/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-Separate.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-dev-29289db [2021-06-05 14:45:51,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 14:45:51,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 14:45:51,934 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 14:45:51,935 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 14:45:51,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 14:45:51,939 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 14:45:51,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 14:45:51,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 14:45:51,947 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 14:45:51,948 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 14:45:51,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 14:45:51,949 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 14:45:51,950 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 14:45:51,951 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 14:45:51,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 14:45:51,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 14:45:51,954 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 14:45:51,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 14:45:51,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 14:45:51,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 14:45:51,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 14:45:51,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 14:45:51,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 14:45:51,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 14:45:51,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 14:45:51,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 14:45:51,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 14:45:51,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 14:45:51,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 14:45:51,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 14:45:51,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 14:45:51,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 14:45:51,972 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 14:45:51,972 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 14:45:51,972 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 14:45:51,973 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 14:45:51,973 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 14:45:51,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 14:45:51,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 14:45:51,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 14:45:51,974 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-Separate.epf [2021-06-05 14:45:52,000 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 14:45:52,001 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 14:45:52,001 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 14:45:52,001 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 14:45:52,002 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 14:45:52,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 14:45:52,002 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 14:45:52,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 14:45:52,002 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 14:45:52,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 14:45:52,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 14:45:52,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 14:45:52,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 14:45:52,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 14:45:52,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 14:45:52,003 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 14:45:52,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 14:45:52,003 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 14:45:52,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 14:45:52,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 14:45:52,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 14:45:52,003 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 14:45:52,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 14:45:52,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 14:45:52,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 14:45:52,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 14:45:52,004 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 14:45:52,004 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 14:45:52,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 14:45:52,004 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 14:45:52,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 14:45:52,004 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 14:45:52,004 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 14:45:52,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 14:45:52,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 14:45:52,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 14:45:52,254 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-05 14:45:52,256 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-05 14:45:52,257 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 14:45:52,257 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 14:45:52,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 14:45:52,294 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-05 14:45:52,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 14:45:52,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 14:45:52,296 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 14:45:52,303 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 02:45:52" (1/1) ... [2021-06-05 14:45:52,321 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 02:45:52" (1/1) ... [2021-06-05 14:45:52,331 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 14:45:52,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 14:45:52,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 14:45:52,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 14:45:52,339 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 02:45:52" (1/1) ... [2021-06-05 14:45:52,339 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 02:45:52" (1/1) ... [2021-06-05 14:45:52,341 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 02:45:52" (1/1) ... [2021-06-05 14:45:52,341 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 02:45:52" (1/1) ... [2021-06-05 14:45:52,353 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 02:45:52" (1/1) ... [2021-06-05 14:45:52,356 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 02:45:52" (1/1) ... [2021-06-05 14:45:52,357 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 02:45:52" (1/1) ... [2021-06-05 14:45:52,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 14:45:52,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 14:45:52,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 14:45:52,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 14:45:52,359 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 02:45:52" (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 14:45:52,406 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-06-05 14:45:52,406 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-05 14:45:52,406 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-05 14:45:52,407 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-06-05 14:45:52,407 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-05 14:45:52,407 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-05 14:45:52,407 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-05 14:45:52,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 14:45:52,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 14:45:52,407 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-06-05 14:45:52,408 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-06-05 14:45:52,408 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-06-05 14:45:52,409 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 14:45:52,726 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 14:45:52,727 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-06-05 14:45:52,728 INFO L202 PluginConnector]: Adding new model word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 02:45:52 BoogieIcfgContainer [2021-06-05 14:45:52,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 14:45:52,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 14:45:52,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 14:45:52,731 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 14:45:52,731 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 02:45:52" (1/2) ... [2021-06-05 14:45:52,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca11e57 and model type word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 02:45:52, skipping insertion in model container [2021-06-05 14:45:52,732 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 02:45:52" (2/2) ... [2021-06-05 14:45:52,732 INFO L111 eAbstractionObserver]: Analyzing ICFG word-subst.wvr.bpl [2021-06-05 14:45:52,736 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 14:45:52,736 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 14:45:52,736 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 14:45:52,737 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 14:45:52,762 INFO L149 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-06-05 14:45:52,777 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 14:45:52,789 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 14:45:52,789 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 14:45:52,789 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 14:45:52,789 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 14:45:52,789 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 14:45:52,789 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 14:45:52,790 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 14:45:52,790 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 14:45:52,795 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 32 places, 28 transitions, 80 flow [2021-06-05 14:45:52,813 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 14:45:52,815 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 14:45:52,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 14:45:52,821 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:52,821 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:52,821 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:52,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:52,827 INFO L82 PathProgramCache]: Analyzing trace with hash -200100504, now seen corresponding path program 1 times [2021-06-05 14:45:52,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:52,833 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714820954] [2021-06-05 14:45:52,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:53,039 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 14:45:53,039 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:53,040 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714820954] [2021-06-05 14:45:53,040 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714820954] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:53,040 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:53,040 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 14:45:53,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135635433] [2021-06-05 14:45:53,044 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 14:45:53,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:53,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 14:45:53,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 14:45:53,061 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 14:45:53,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:53,118 INFO L93 Difference]: Finished difference Result 171 states and 561 transitions. [2021-06-05 14:45:53,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 14:45:53,119 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 14:45:53,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:53,128 INFO L225 Difference]: With dead ends: 171 [2021-06-05 14:45:53,128 INFO L226 Difference]: Without dead ends: 108 [2021-06-05 14:45:53,130 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 14:45:53,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-06-05 14:45:53,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-06-05 14:45:53,175 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 14:45:53,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 353 transitions. [2021-06-05 14:45:53,179 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 353 transitions. Word has length 14 [2021-06-05 14:45:53,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:53,180 INFO L482 AbstractCegarLoop]: Abstraction has 108 states and 353 transitions. [2021-06-05 14:45:53,180 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 14:45:53,180 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 353 transitions. [2021-06-05 14:45:53,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:45:53,182 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:53,183 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:53,183 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 14:45:53,184 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:53,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:53,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1713787741, now seen corresponding path program 1 times [2021-06-05 14:45:53,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:53,188 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507009685] [2021-06-05 14:45:53,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:53,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 14:45:53,288 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:53,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507009685] [2021-06-05 14:45:53,289 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507009685] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:53,289 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:53,289 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:45:53,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900731643] [2021-06-05 14:45:53,291 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:45:53,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:53,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:45:53,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:45:53,292 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 14:45:53,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:53,397 INFO L93 Difference]: Finished difference Result 172 states and 504 transitions. [2021-06-05 14:45:53,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:45:53,398 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 14:45:53,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:53,399 INFO L225 Difference]: With dead ends: 172 [2021-06-05 14:45:53,399 INFO L226 Difference]: Without dead ends: 153 [2021-06-05 14:45:53,400 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 64.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:45:53,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-06-05 14:45:53,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 123. [2021-06-05 14:45:53,414 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 14:45:53,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 390 transitions. [2021-06-05 14:45:53,415 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 390 transitions. Word has length 15 [2021-06-05 14:45:53,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:53,417 INFO L482 AbstractCegarLoop]: Abstraction has 123 states and 390 transitions. [2021-06-05 14:45:53,417 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 14:45:53,417 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 390 transitions. [2021-06-05 14:45:53,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:45:53,418 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:53,419 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:53,419 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 14:45:53,419 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:53,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:53,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1520780803, now seen corresponding path program 2 times [2021-06-05 14:45:53,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:53,420 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978703201] [2021-06-05 14:45:53,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:53,480 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 14:45:53,480 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:53,480 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978703201] [2021-06-05 14:45:53,480 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978703201] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:53,480 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:53,480 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:45:53,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80580677] [2021-06-05 14:45:53,481 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:45:53,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:53,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:45:53,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:45:53,482 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 14:45:53,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:53,556 INFO L93 Difference]: Finished difference Result 179 states and 520 transitions. [2021-06-05 14:45:53,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:45:53,557 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 14:45:53,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:53,559 INFO L225 Difference]: With dead ends: 179 [2021-06-05 14:45:53,559 INFO L226 Difference]: Without dead ends: 160 [2021-06-05 14:45:53,560 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:45:53,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-06-05 14:45:53,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 131. [2021-06-05 14:45:53,571 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 14:45:53,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 410 transitions. [2021-06-05 14:45:53,571 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 410 transitions. Word has length 15 [2021-06-05 14:45:53,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:53,572 INFO L482 AbstractCegarLoop]: Abstraction has 131 states and 410 transitions. [2021-06-05 14:45:53,572 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 14:45:53,572 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 410 transitions. [2021-06-05 14:45:53,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:45:53,572 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:53,573 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:53,573 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 14:45:53,573 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:53,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:53,573 INFO L82 PathProgramCache]: Analyzing trace with hash 372369077, now seen corresponding path program 3 times [2021-06-05 14:45:53,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:53,573 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422911018] [2021-06-05 14:45:53,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:53,661 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 14:45:53,661 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:53,661 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422911018] [2021-06-05 14:45:53,662 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422911018] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:53,662 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:53,662 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:45:53,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321367090] [2021-06-05 14:45:53,662 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:45:53,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:53,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:45:53,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:45:53,663 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 14:45:53,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:53,739 INFO L93 Difference]: Finished difference Result 235 states and 657 transitions. [2021-06-05 14:45:53,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:45:53,740 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 14:45:53,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:53,741 INFO L225 Difference]: With dead ends: 235 [2021-06-05 14:45:53,741 INFO L226 Difference]: Without dead ends: 216 [2021-06-05 14:45:53,741 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 75.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:45:53,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-06-05 14:45:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 135. [2021-06-05 14:45:53,747 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 14:45:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 422 transitions. [2021-06-05 14:45:53,748 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 422 transitions. Word has length 15 [2021-06-05 14:45:53,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:53,748 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 422 transitions. [2021-06-05 14:45:53,748 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 14:45:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 422 transitions. [2021-06-05 14:45:53,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:45:53,749 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:53,749 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:53,749 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 14:45:53,749 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:53,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:53,749 INFO L82 PathProgramCache]: Analyzing trace with hash 384286855, now seen corresponding path program 4 times [2021-06-05 14:45:53,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:53,749 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964162978] [2021-06-05 14:45:53,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:53,810 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 14:45:53,810 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:53,810 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964162978] [2021-06-05 14:45:53,810 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964162978] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:53,810 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:53,810 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:45:53,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761320301] [2021-06-05 14:45:53,811 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:45:53,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:53,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:45:53,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:45:53,811 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 14:45:53,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:53,878 INFO L93 Difference]: Finished difference Result 194 states and 550 transitions. [2021-06-05 14:45:53,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:45:53,878 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 14:45:53,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:53,880 INFO L225 Difference]: With dead ends: 194 [2021-06-05 14:45:53,880 INFO L226 Difference]: Without dead ends: 171 [2021-06-05 14:45:53,880 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 72.9ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:45:53,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-06-05 14:45:53,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 135. [2021-06-05 14:45:53,895 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 14:45:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 420 transitions. [2021-06-05 14:45:53,896 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 420 transitions. Word has length 15 [2021-06-05 14:45:53,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:53,896 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 420 transitions. [2021-06-05 14:45:53,897 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 14:45:53,897 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 420 transitions. [2021-06-05 14:45:53,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:45:53,897 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:53,897 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:53,897 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 14:45:53,898 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:53,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:53,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1046340473, now seen corresponding path program 5 times [2021-06-05 14:45:53,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:53,898 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915768209] [2021-06-05 14:45:53,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:53,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 14:45:53,991 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:53,991 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915768209] [2021-06-05 14:45:53,991 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915768209] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:53,991 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:53,991 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:45:53,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151302247] [2021-06-05 14:45:53,992 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:45:53,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:53,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:45:53,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:45:53,992 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 14:45:54,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:54,067 INFO L93 Difference]: Finished difference Result 228 states and 638 transitions. [2021-06-05 14:45:54,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:45:54,068 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 14:45:54,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:54,069 INFO L225 Difference]: With dead ends: 228 [2021-06-05 14:45:54,069 INFO L226 Difference]: Without dead ends: 209 [2021-06-05 14:45:54,069 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 75.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:45:54,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-06-05 14:45:54,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 137. [2021-06-05 14:45:54,073 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 14:45:54,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 427 transitions. [2021-06-05 14:45:54,074 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 427 transitions. Word has length 15 [2021-06-05 14:45:54,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:54,074 INFO L482 AbstractCegarLoop]: Abstraction has 137 states and 427 transitions. [2021-06-05 14:45:54,074 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 14:45:54,074 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 427 transitions. [2021-06-05 14:45:54,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:45:54,075 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:54,075 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:54,075 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 14:45:54,075 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:54,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:54,075 INFO L82 PathProgramCache]: Analyzing trace with hash -964122021, now seen corresponding path program 6 times [2021-06-05 14:45:54,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:54,075 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801553735] [2021-06-05 14:45:54,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:54,136 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 14:45:54,136 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:54,136 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801553735] [2021-06-05 14:45:54,137 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801553735] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:54,137 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:54,137 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:45:54,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569051279] [2021-06-05 14:45:54,137 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:45:54,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:54,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:45:54,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:45:54,138 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 14:45:54,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:54,195 INFO L93 Difference]: Finished difference Result 195 states and 552 transitions. [2021-06-05 14:45:54,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:45:54,196 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 14:45:54,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:54,197 INFO L225 Difference]: With dead ends: 195 [2021-06-05 14:45:54,197 INFO L226 Difference]: Without dead ends: 172 [2021-06-05 14:45:54,197 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 66.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:45:54,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-06-05 14:45:54,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 137. [2021-06-05 14:45:54,200 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 14:45:54,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 425 transitions. [2021-06-05 14:45:54,201 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 425 transitions. Word has length 15 [2021-06-05 14:45:54,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:54,201 INFO L482 AbstractCegarLoop]: Abstraction has 137 states and 425 transitions. [2021-06-05 14:45:54,201 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 14:45:54,201 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 425 transitions. [2021-06-05 14:45:54,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:45:54,202 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:54,202 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:54,202 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 14:45:54,202 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:54,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:54,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1568921575, now seen corresponding path program 1 times [2021-06-05 14:45:54,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:54,203 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323618021] [2021-06-05 14:45:54,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:54,220 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 14:45:54,220 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:54,220 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323618021] [2021-06-05 14:45:54,221 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323618021] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:54,221 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:54,221 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 14:45:54,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634609335] [2021-06-05 14:45:54,221 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 14:45:54,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:54,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 14:45:54,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 14:45:54,222 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 14:45:54,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:54,250 INFO L93 Difference]: Finished difference Result 203 states and 586 transitions. [2021-06-05 14:45:54,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:45:54,257 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 14:45:54,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:54,258 INFO L225 Difference]: With dead ends: 203 [2021-06-05 14:45:54,258 INFO L226 Difference]: Without dead ends: 203 [2021-06-05 14:45:54,258 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:45:54,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-06-05 14:45:54,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 136. [2021-06-05 14:45:54,261 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 14:45:54,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 421 transitions. [2021-06-05 14:45:54,262 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 421 transitions. Word has length 16 [2021-06-05 14:45:54,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:54,262 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 421 transitions. [2021-06-05 14:45:54,262 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 14:45:54,262 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 421 transitions. [2021-06-05 14:45:54,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:45:54,263 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:54,263 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:54,263 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 14:45:54,263 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:54,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:54,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1557107456, now seen corresponding path program 1 times [2021-06-05 14:45:54,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:54,263 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361792701] [2021-06-05 14:45:54,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:54,275 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 14:45:54,275 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:54,275 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361792701] [2021-06-05 14:45:54,275 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361792701] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:54,275 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:54,275 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 14:45:54,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098726579] [2021-06-05 14:45:54,276 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 14:45:54,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:54,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 14:45:54,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 14:45:54,276 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 14:45:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:54,292 INFO L93 Difference]: Finished difference Result 194 states and 542 transitions. [2021-06-05 14:45:54,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:45:54,292 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 14:45:54,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:54,293 INFO L225 Difference]: With dead ends: 194 [2021-06-05 14:45:54,293 INFO L226 Difference]: Without dead ends: 171 [2021-06-05 14:45:54,293 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:45:54,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-06-05 14:45:54,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 136. [2021-06-05 14:45:54,296 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 14:45:54,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 408 transitions. [2021-06-05 14:45:54,296 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 408 transitions. Word has length 16 [2021-06-05 14:45:54,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:54,297 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 408 transitions. [2021-06-05 14:45:54,297 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 14:45:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 408 transitions. [2021-06-05 14:45:54,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:45:54,297 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:54,297 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:54,297 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 14:45:54,297 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:54,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:54,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1420564495, now seen corresponding path program 2 times [2021-06-05 14:45:54,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:54,298 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412765561] [2021-06-05 14:45:54,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:54,309 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 14:45:54,309 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:54,309 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412765561] [2021-06-05 14:45:54,309 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412765561] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:54,309 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:54,309 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 14:45:54,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326418773] [2021-06-05 14:45:54,310 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 14:45:54,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:54,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 14:45:54,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 14:45:54,310 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 14:45:54,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:54,325 INFO L93 Difference]: Finished difference Result 205 states and 567 transitions. [2021-06-05 14:45:54,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:45:54,329 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 14:45:54,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:54,330 INFO L225 Difference]: With dead ends: 205 [2021-06-05 14:45:54,330 INFO L226 Difference]: Without dead ends: 205 [2021-06-05 14:45:54,330 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:45:54,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-06-05 14:45:54,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 114. [2021-06-05 14:45:54,333 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 14:45:54,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 330 transitions. [2021-06-05 14:45:54,333 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 330 transitions. Word has length 16 [2021-06-05 14:45:54,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:54,333 INFO L482 AbstractCegarLoop]: Abstraction has 114 states and 330 transitions. [2021-06-05 14:45:54,333 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 14:45:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 330 transitions. [2021-06-05 14:45:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:45:54,334 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:54,334 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:54,334 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 14:45:54,334 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:54,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:54,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1521275701, now seen corresponding path program 3 times [2021-06-05 14:45:54,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:54,334 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271598802] [2021-06-05 14:45:54,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:54,354 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 14:45:54,354 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:54,354 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271598802] [2021-06-05 14:45:54,354 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271598802] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:54,354 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:54,354 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 14:45:54,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096065374] [2021-06-05 14:45:54,355 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 14:45:54,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:54,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 14:45:54,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 14:45:54,355 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 14:45:54,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:54,366 INFO L93 Difference]: Finished difference Result 171 states and 460 transitions. [2021-06-05 14:45:54,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 14:45:54,366 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 14:45:54,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:54,367 INFO L225 Difference]: With dead ends: 171 [2021-06-05 14:45:54,367 INFO L226 Difference]: Without dead ends: 165 [2021-06-05 14:45:54,367 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:45:54,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-06-05 14:45:54,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 110. [2021-06-05 14:45:54,369 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 14:45:54,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 317 transitions. [2021-06-05 14:45:54,370 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 317 transitions. Word has length 16 [2021-06-05 14:45:54,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:54,370 INFO L482 AbstractCegarLoop]: Abstraction has 110 states and 317 transitions. [2021-06-05 14:45:54,370 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 14:45:54,370 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 317 transitions. [2021-06-05 14:45:54,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:45:54,370 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:54,370 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:54,370 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 14:45:54,370 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:54,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:54,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1372165464, now seen corresponding path program 2 times [2021-06-05 14:45:54,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:54,371 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272596349] [2021-06-05 14:45:54,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:54,384 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 14:45:54,384 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:54,384 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272596349] [2021-06-05 14:45:54,384 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272596349] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:54,384 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:54,384 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 14:45:54,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790572860] [2021-06-05 14:45:54,384 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 14:45:54,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:54,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 14:45:54,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 14:45:54,385 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 14:45:54,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:54,400 INFO L93 Difference]: Finished difference Result 179 states and 482 transitions. [2021-06-05 14:45:54,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:45:54,401 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 14:45:54,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:54,402 INFO L225 Difference]: With dead ends: 179 [2021-06-05 14:45:54,402 INFO L226 Difference]: Without dead ends: 164 [2021-06-05 14:45:54,402 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:45:54,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-06-05 14:45:54,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 114. [2021-06-05 14:45:54,405 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 14:45:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 323 transitions. [2021-06-05 14:45:54,405 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 323 transitions. Word has length 16 [2021-06-05 14:45:54,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:54,405 INFO L482 AbstractCegarLoop]: Abstraction has 114 states and 323 transitions. [2021-06-05 14:45:54,405 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 14:45:54,405 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 323 transitions. [2021-06-05 14:45:54,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:45:54,406 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:54,406 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:54,406 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 14:45:54,406 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:54,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:54,406 INFO L82 PathProgramCache]: Analyzing trace with hash -507426732, now seen corresponding path program 3 times [2021-06-05 14:45:54,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:54,406 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455943287] [2021-06-05 14:45:54,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:54,418 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 14:45:54,418 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:54,418 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455943287] [2021-06-05 14:45:54,418 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455943287] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:54,418 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:54,419 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 14:45:54,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367311215] [2021-06-05 14:45:54,419 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 14:45:54,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:54,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 14:45:54,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 14:45:54,419 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 14:45:54,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:54,430 INFO L93 Difference]: Finished difference Result 156 states and 416 transitions. [2021-06-05 14:45:54,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 14:45:54,431 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 14:45:54,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:54,431 INFO L225 Difference]: With dead ends: 156 [2021-06-05 14:45:54,431 INFO L226 Difference]: Without dead ends: 146 [2021-06-05 14:45:54,431 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:45:54,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-06-05 14:45:54,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 110. [2021-06-05 14:45:54,434 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 14:45:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 315 transitions. [2021-06-05 14:45:54,434 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 315 transitions. Word has length 16 [2021-06-05 14:45:54,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:54,434 INFO L482 AbstractCegarLoop]: Abstraction has 110 states and 315 transitions. [2021-06-05 14:45:54,434 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 14:45:54,434 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 315 transitions. [2021-06-05 14:45:54,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:45:54,435 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:54,435 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:54,435 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 14:45:54,435 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:54,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:54,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1294148210, now seen corresponding path program 4 times [2021-06-05 14:45:54,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:54,435 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007012109] [2021-06-05 14:45:54,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:54,451 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 14:45:54,451 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:54,451 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007012109] [2021-06-05 14:45:54,451 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007012109] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:54,451 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:54,451 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 14:45:54,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094864265] [2021-06-05 14:45:54,451 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 14:45:54,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:54,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 14:45:54,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 14:45:54,452 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 14:45:54,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:54,462 INFO L93 Difference]: Finished difference Result 151 states and 405 transitions. [2021-06-05 14:45:54,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 14:45:54,462 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 14:45:54,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:54,463 INFO L225 Difference]: With dead ends: 151 [2021-06-05 14:45:54,463 INFO L226 Difference]: Without dead ends: 145 [2021-06-05 14:45:54,463 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:45:54,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-06-05 14:45:54,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 110. [2021-06-05 14:45:54,465 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 14:45:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 312 transitions. [2021-06-05 14:45:54,465 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 312 transitions. Word has length 16 [2021-06-05 14:45:54,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:54,466 INFO L482 AbstractCegarLoop]: Abstraction has 110 states and 312 transitions. [2021-06-05 14:45:54,466 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 14:45:54,466 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 312 transitions. [2021-06-05 14:45:54,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:45:54,466 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:54,466 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:54,466 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 14:45:54,466 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:54,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:54,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1904685263, now seen corresponding path program 4 times [2021-06-05 14:45:54,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:54,467 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651951973] [2021-06-05 14:45:54,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:54,477 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 14:45:54,477 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:54,477 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651951973] [2021-06-05 14:45:54,477 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651951973] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:54,477 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:54,478 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 14:45:54,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531334949] [2021-06-05 14:45:54,478 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 14:45:54,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:54,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 14:45:54,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 14:45:54,478 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 14:45:54,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:54,487 INFO L93 Difference]: Finished difference Result 116 states and 321 transitions. [2021-06-05 14:45:54,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 14:45:54,487 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 14:45:54,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:54,488 INFO L225 Difference]: With dead ends: 116 [2021-06-05 14:45:54,488 INFO L226 Difference]: Without dead ends: 108 [2021-06-05 14:45:54,488 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:45:54,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-06-05 14:45:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-06-05 14:45:54,490 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 14:45:54,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 308 transitions. [2021-06-05 14:45:54,490 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 308 transitions. Word has length 16 [2021-06-05 14:45:54,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:54,490 INFO L482 AbstractCegarLoop]: Abstraction has 108 states and 308 transitions. [2021-06-05 14:45:54,490 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 14:45:54,490 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 308 transitions. [2021-06-05 14:45:54,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:54,491 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:54,491 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:54,491 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 14:45:54,491 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:54,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:54,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1361223606, now seen corresponding path program 1 times [2021-06-05 14:45:54,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:54,491 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131201908] [2021-06-05 14:45:54,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:54,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 14:45:54,543 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:54,543 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131201908] [2021-06-05 14:45:54,543 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131201908] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:54,543 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:54,543 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:54,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535787865] [2021-06-05 14:45:54,543 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:54,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:54,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:54,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:54,544 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 14:45:54,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:54,667 INFO L93 Difference]: Finished difference Result 265 states and 721 transitions. [2021-06-05 14:45:54,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:54,667 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 14:45:54,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:54,668 INFO L225 Difference]: With dead ends: 265 [2021-06-05 14:45:54,668 INFO L226 Difference]: Without dead ends: 250 [2021-06-05 14:45:54,669 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 104.0ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:45:54,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-06-05 14:45:54,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 141. [2021-06-05 14:45:54,673 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 14:45:54,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 391 transitions. [2021-06-05 14:45:54,673 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 391 transitions. Word has length 17 [2021-06-05 14:45:54,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:54,674 INFO L482 AbstractCegarLoop]: Abstraction has 141 states and 391 transitions. [2021-06-05 14:45:54,674 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 14:45:54,674 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 391 transitions. [2021-06-05 14:45:54,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:54,675 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:54,675 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:54,675 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 14:45:54,675 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:54,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:54,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1726190618, now seen corresponding path program 2 times [2021-06-05 14:45:54,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:54,676 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624684496] [2021-06-05 14:45:54,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:54,758 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 14:45:54,758 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:54,758 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624684496] [2021-06-05 14:45:54,758 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624684496] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:54,759 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:54,759 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:54,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730812898] [2021-06-05 14:45:54,760 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:54,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:54,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:54,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:54,760 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 14:45:54,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:54,920 INFO L93 Difference]: Finished difference Result 298 states and 795 transitions. [2021-06-05 14:45:54,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:54,929 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 14:45:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:54,931 INFO L225 Difference]: With dead ends: 298 [2021-06-05 14:45:54,931 INFO L226 Difference]: Without dead ends: 283 [2021-06-05 14:45:54,932 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 144.2ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:45:54,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-06-05 14:45:54,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 150. [2021-06-05 14:45:54,939 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 14:45:54,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 418 transitions. [2021-06-05 14:45:54,939 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 418 transitions. Word has length 17 [2021-06-05 14:45:54,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:54,939 INFO L482 AbstractCegarLoop]: Abstraction has 150 states and 418 transitions. [2021-06-05 14:45:54,939 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 14:45:54,940 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 418 transitions. [2021-06-05 14:45:54,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:54,940 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:54,940 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:54,940 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 14:45:54,940 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:54,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:54,941 INFO L82 PathProgramCache]: Analyzing trace with hash 870056290, now seen corresponding path program 3 times [2021-06-05 14:45:54,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:54,941 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015349869] [2021-06-05 14:45:54,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:55,018 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 14:45:55,018 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:55,018 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015349869] [2021-06-05 14:45:55,018 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015349869] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:55,019 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:55,019 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:55,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525618162] [2021-06-05 14:45:55,019 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:55,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:55,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:55,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:55,019 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 14:45:55,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:55,183 INFO L93 Difference]: Finished difference Result 281 states and 763 transitions. [2021-06-05 14:45:55,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:55,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 14:45:55,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:55,185 INFO L225 Difference]: With dead ends: 281 [2021-06-05 14:45:55,185 INFO L226 Difference]: Without dead ends: 266 [2021-06-05 14:45:55,185 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 150.6ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:45:55,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-06-05 14:45:55,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 150. [2021-06-05 14:45:55,189 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 14:45:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 418 transitions. [2021-06-05 14:45:55,189 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 418 transitions. Word has length 17 [2021-06-05 14:45:55,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:55,189 INFO L482 AbstractCegarLoop]: Abstraction has 150 states and 418 transitions. [2021-06-05 14:45:55,189 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 14:45:55,190 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 418 transitions. [2021-06-05 14:45:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:55,190 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:55,190 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:55,190 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 14:45:55,190 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:55,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:55,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2059322360, now seen corresponding path program 4 times [2021-06-05 14:45:55,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:55,191 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805754825] [2021-06-05 14:45:55,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:55,265 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 14:45:55,266 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:55,266 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805754825] [2021-06-05 14:45:55,266 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805754825] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:55,266 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:55,266 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:55,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328899589] [2021-06-05 14:45:55,266 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:55,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:55,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:55,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:55,267 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 14:45:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:55,387 INFO L93 Difference]: Finished difference Result 289 states and 784 transitions. [2021-06-05 14:45:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:55,388 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 14:45:55,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:55,389 INFO L225 Difference]: With dead ends: 289 [2021-06-05 14:45:55,389 INFO L226 Difference]: Without dead ends: 274 [2021-06-05 14:45:55,389 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 112.3ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:45:55,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-06-05 14:45:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 159. [2021-06-05 14:45:55,392 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 14:45:55,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 442 transitions. [2021-06-05 14:45:55,393 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 442 transitions. Word has length 17 [2021-06-05 14:45:55,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:55,393 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 442 transitions. [2021-06-05 14:45:55,393 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 14:45:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 442 transitions. [2021-06-05 14:45:55,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:55,393 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:55,393 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:55,393 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 14:45:55,393 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:55,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:55,394 INFO L82 PathProgramCache]: Analyzing trace with hash 2033546876, now seen corresponding path program 5 times [2021-06-05 14:45:55,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:55,394 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956713416] [2021-06-05 14:45:55,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:55,449 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 14:45:55,449 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:55,449 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956713416] [2021-06-05 14:45:55,449 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956713416] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:55,449 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:55,450 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:55,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243590721] [2021-06-05 14:45:55,450 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:55,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:55,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:55,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:55,450 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 14:45:55,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:55,597 INFO L93 Difference]: Finished difference Result 322 states and 859 transitions. [2021-06-05 14:45:55,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:55,597 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 14:45:55,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:55,598 INFO L225 Difference]: With dead ends: 322 [2021-06-05 14:45:55,598 INFO L226 Difference]: Without dead ends: 307 [2021-06-05 14:45:55,599 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 131.2ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:45:55,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-06-05 14:45:55,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 162. [2021-06-05 14:45:55,602 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 14:45:55,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 456 transitions. [2021-06-05 14:45:55,602 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 456 transitions. Word has length 17 [2021-06-05 14:45:55,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:55,603 INFO L482 AbstractCegarLoop]: Abstraction has 162 states and 456 transitions. [2021-06-05 14:45:55,603 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 14:45:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 456 transitions. [2021-06-05 14:45:55,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:55,603 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:55,603 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:55,603 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 14:45:55,603 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:55,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:55,603 INFO L82 PathProgramCache]: Analyzing trace with hash 334826488, now seen corresponding path program 6 times [2021-06-05 14:45:55,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:55,604 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993063712] [2021-06-05 14:45:55,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:55,655 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 14:45:55,655 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:55,655 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993063712] [2021-06-05 14:45:55,655 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993063712] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:55,655 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:55,655 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:55,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791291047] [2021-06-05 14:45:55,656 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:55,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:55,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:55,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:55,656 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 14:45:55,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:55,832 INFO L93 Difference]: Finished difference Result 299 states and 814 transitions. [2021-06-05 14:45:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:55,832 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 14:45:55,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:55,833 INFO L225 Difference]: With dead ends: 299 [2021-06-05 14:45:55,833 INFO L226 Difference]: Without dead ends: 284 [2021-06-05 14:45:55,833 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 144.3ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:45:55,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-06-05 14:45:55,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 159. [2021-06-05 14:45:55,836 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 14:45:55,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 442 transitions. [2021-06-05 14:45:55,837 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 442 transitions. Word has length 17 [2021-06-05 14:45:55,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:55,837 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 442 transitions. [2021-06-05 14:45:55,837 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 14:45:55,837 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 442 transitions. [2021-06-05 14:45:55,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:55,837 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:55,838 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:55,838 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 14:45:55,838 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:55,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:55,838 INFO L82 PathProgramCache]: Analyzing trace with hash -2035892590, now seen corresponding path program 7 times [2021-06-05 14:45:55,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:55,838 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004698958] [2021-06-05 14:45:55,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:55,885 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 14:45:55,885 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:55,885 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004698958] [2021-06-05 14:45:55,885 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004698958] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:55,885 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:55,885 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:55,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525947081] [2021-06-05 14:45:55,885 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:55,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:55,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:55,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:55,886 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 14:45:56,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:56,063 INFO L93 Difference]: Finished difference Result 389 states and 1040 transitions. [2021-06-05 14:45:56,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:56,064 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 14:45:56,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:56,065 INFO L225 Difference]: With dead ends: 389 [2021-06-05 14:45:56,065 INFO L226 Difference]: Without dead ends: 374 [2021-06-05 14:45:56,065 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 131.9ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:45:56,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-06-05 14:45:56,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 166. [2021-06-05 14:45:56,069 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 14:45:56,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 470 transitions. [2021-06-05 14:45:56,069 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 470 transitions. Word has length 17 [2021-06-05 14:45:56,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:56,069 INFO L482 AbstractCegarLoop]: Abstraction has 166 states and 470 transitions. [2021-06-05 14:45:56,069 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 14:45:56,070 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 470 transitions. [2021-06-05 14:45:56,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:56,070 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:56,070 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:56,070 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-05 14:45:56,070 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:56,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:56,070 INFO L82 PathProgramCache]: Analyzing trace with hash -828339518, now seen corresponding path program 8 times [2021-06-05 14:45:56,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:56,070 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822102454] [2021-06-05 14:45:56,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:56,137 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 14:45:56,138 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:56,138 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822102454] [2021-06-05 14:45:56,138 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822102454] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:56,138 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:56,138 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:56,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574499157] [2021-06-05 14:45:56,138 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:56,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:56,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:56,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:56,139 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 14:45:56,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:56,338 INFO L93 Difference]: Finished difference Result 398 states and 1066 transitions. [2021-06-05 14:45:56,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:56,338 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 14:45:56,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:56,340 INFO L225 Difference]: With dead ends: 398 [2021-06-05 14:45:56,340 INFO L226 Difference]: Without dead ends: 383 [2021-06-05 14:45:56,340 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 183.0ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:45:56,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-06-05 14:45:56,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 169. [2021-06-05 14:45:56,346 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 14:45:56,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 484 transitions. [2021-06-05 14:45:56,347 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 484 transitions. Word has length 17 [2021-06-05 14:45:56,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:56,347 INFO L482 AbstractCegarLoop]: Abstraction has 169 states and 484 transitions. [2021-06-05 14:45:56,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 14:45:56,347 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 484 transitions. [2021-06-05 14:45:56,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:56,347 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:56,347 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:56,347 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 14:45:56,347 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:56,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:56,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1767907390, now seen corresponding path program 9 times [2021-06-05 14:45:56,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:56,348 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822776006] [2021-06-05 14:45:56,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:56,402 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 14:45:56,402 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:56,402 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822776006] [2021-06-05 14:45:56,403 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822776006] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:56,403 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:56,403 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:56,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524572996] [2021-06-05 14:45:56,403 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:56,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:56,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:56,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:56,404 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 14:45:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:56,579 INFO L93 Difference]: Finished difference Result 405 states and 1082 transitions. [2021-06-05 14:45:56,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:56,580 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 14:45:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:56,581 INFO L225 Difference]: With dead ends: 405 [2021-06-05 14:45:56,581 INFO L226 Difference]: Without dead ends: 390 [2021-06-05 14:45:56,581 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 149.5ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:45:56,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-06-05 14:45:56,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 161. [2021-06-05 14:45:56,585 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 14:45:56,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 452 transitions. [2021-06-05 14:45:56,586 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 452 transitions. Word has length 17 [2021-06-05 14:45:56,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:56,586 INFO L482 AbstractCegarLoop]: Abstraction has 161 states and 452 transitions. [2021-06-05 14:45:56,586 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 14:45:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 452 transitions. [2021-06-05 14:45:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:56,586 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:56,586 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:56,586 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 14:45:56,586 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:56,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:56,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1043349262, now seen corresponding path program 10 times [2021-06-05 14:45:56,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:56,587 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035353558] [2021-06-05 14:45:56,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:56,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 14:45:56,638 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:56,638 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035353558] [2021-06-05 14:45:56,638 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035353558] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:56,638 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:56,639 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:56,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129215802] [2021-06-05 14:45:56,639 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:56,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:56,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:56,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:56,639 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 14:45:56,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:56,723 INFO L93 Difference]: Finished difference Result 340 states and 918 transitions. [2021-06-05 14:45:56,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:56,723 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 14:45:56,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:56,724 INFO L225 Difference]: With dead ends: 340 [2021-06-05 14:45:56,724 INFO L226 Difference]: Without dead ends: 325 [2021-06-05 14:45:56,724 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 71.2ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:45:56,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-06-05 14:45:56,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 165. [2021-06-05 14:45:56,731 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 14:45:56,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 466 transitions. [2021-06-05 14:45:56,732 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 466 transitions. Word has length 17 [2021-06-05 14:45:56,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:56,732 INFO L482 AbstractCegarLoop]: Abstraction has 165 states and 466 transitions. [2021-06-05 14:45:56,732 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 14:45:56,732 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 466 transitions. [2021-06-05 14:45:56,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:56,732 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:56,733 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:56,733 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-05 14:45:56,733 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:56,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:56,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1480345592, now seen corresponding path program 11 times [2021-06-05 14:45:56,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:56,733 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884184254] [2021-06-05 14:45:56,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:56,788 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 14:45:56,788 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:56,788 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884184254] [2021-06-05 14:45:56,788 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884184254] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:56,789 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:56,789 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:56,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232677728] [2021-06-05 14:45:56,789 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:56,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:56,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:56,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:56,790 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 14:45:56,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:56,905 INFO L93 Difference]: Finished difference Result 335 states and 909 transitions. [2021-06-05 14:45:56,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:56,905 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 14:45:56,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:56,906 INFO L225 Difference]: With dead ends: 335 [2021-06-05 14:45:56,906 INFO L226 Difference]: Without dead ends: 320 [2021-06-05 14:45:56,907 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 94.7ms TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:45:56,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-06-05 14:45:56,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 171. [2021-06-05 14:45:56,910 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 14:45:56,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 483 transitions. [2021-06-05 14:45:56,910 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 483 transitions. Word has length 17 [2021-06-05 14:45:56,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:56,910 INFO L482 AbstractCegarLoop]: Abstraction has 171 states and 483 transitions. [2021-06-05 14:45:56,911 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 14:45:56,911 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 483 transitions. [2021-06-05 14:45:56,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:56,911 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:56,911 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:56,911 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 14:45:56,911 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:56,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:56,911 INFO L82 PathProgramCache]: Analyzing trace with hash -145439044, now seen corresponding path program 12 times [2021-06-05 14:45:56,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:56,912 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859093719] [2021-06-05 14:45:56,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:56,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 14:45:56,957 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:56,957 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859093719] [2021-06-05 14:45:56,958 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859093719] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:56,958 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:56,958 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:56,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101606880] [2021-06-05 14:45:56,958 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:56,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:56,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:56,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:56,958 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 14:45:57,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:57,065 INFO L93 Difference]: Finished difference Result 318 states and 879 transitions. [2021-06-05 14:45:57,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:57,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 14:45:57,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:57,066 INFO L225 Difference]: With dead ends: 318 [2021-06-05 14:45:57,066 INFO L226 Difference]: Without dead ends: 303 [2021-06-05 14:45:57,066 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 91.1ms TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:45:57,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-06-05 14:45:57,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 171. [2021-06-05 14:45:57,069 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 14:45:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 483 transitions. [2021-06-05 14:45:57,070 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 483 transitions. Word has length 17 [2021-06-05 14:45:57,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:57,070 INFO L482 AbstractCegarLoop]: Abstraction has 171 states and 483 transitions. [2021-06-05 14:45:57,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 14:45:57,070 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 483 transitions. [2021-06-05 14:45:57,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:57,070 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:57,070 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:57,070 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 14:45:57,071 INFO L430 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:57,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:57,071 INFO L82 PathProgramCache]: Analyzing trace with hash 161256120, now seen corresponding path program 13 times [2021-06-05 14:45:57,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:57,071 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672161945] [2021-06-05 14:45:57,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:57,110 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 14:45:57,110 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:57,110 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672161945] [2021-06-05 14:45:57,110 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672161945] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:57,110 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:57,110 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:57,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088347159] [2021-06-05 14:45:57,110 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:57,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:57,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:57,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:57,111 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 14:45:57,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:57,226 INFO L93 Difference]: Finished difference Result 385 states and 1046 transitions. [2021-06-05 14:45:57,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:57,226 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 14:45:57,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:57,228 INFO L225 Difference]: With dead ends: 385 [2021-06-05 14:45:57,228 INFO L226 Difference]: Without dead ends: 370 [2021-06-05 14:45:57,229 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 93.2ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:45:57,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-06-05 14:45:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 174. [2021-06-05 14:45:57,232 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 14:45:57,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 498 transitions. [2021-06-05 14:45:57,232 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 498 transitions. Word has length 17 [2021-06-05 14:45:57,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:57,233 INFO L482 AbstractCegarLoop]: Abstraction has 174 states and 498 transitions. [2021-06-05 14:45:57,233 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 14:45:57,233 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 498 transitions. [2021-06-05 14:45:57,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:57,233 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:57,233 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:57,233 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 14:45:57,233 INFO L430 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:57,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:57,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1057379240, now seen corresponding path program 14 times [2021-06-05 14:45:57,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:57,234 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468932566] [2021-06-05 14:45:57,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:57,275 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 14:45:57,275 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:57,275 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468932566] [2021-06-05 14:45:57,275 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468932566] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:57,275 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:57,275 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:57,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875011893] [2021-06-05 14:45:57,275 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:57,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:57,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:57,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:57,276 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 14:45:57,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:57,383 INFO L93 Difference]: Finished difference Result 383 states and 1039 transitions. [2021-06-05 14:45:57,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:57,383 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 14:45:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:57,384 INFO L225 Difference]: With dead ends: 383 [2021-06-05 14:45:57,384 INFO L226 Difference]: Without dead ends: 368 [2021-06-05 14:45:57,384 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 86.2ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:45:57,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-06-05 14:45:57,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 174. [2021-06-05 14:45:57,388 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 14:45:57,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 498 transitions. [2021-06-05 14:45:57,388 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 498 transitions. Word has length 17 [2021-06-05 14:45:57,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:57,388 INFO L482 AbstractCegarLoop]: Abstraction has 174 states and 498 transitions. [2021-06-05 14:45:57,388 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 14:45:57,389 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 498 transitions. [2021-06-05 14:45:57,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:57,389 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:57,389 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:57,389 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 14:45:57,389 INFO L430 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:57,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:57,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1150316668, now seen corresponding path program 15 times [2021-06-05 14:45:57,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:57,389 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066186778] [2021-06-05 14:45:57,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:57,438 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 14:45:57,438 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:57,438 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066186778] [2021-06-05 14:45:57,438 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066186778] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:57,438 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:57,438 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:57,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071062883] [2021-06-05 14:45:57,439 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:57,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:57,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:57,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:57,439 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 14:45:57,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:57,601 INFO L93 Difference]: Finished difference Result 392 states and 1055 transitions. [2021-06-05 14:45:57,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:57,601 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 14:45:57,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:57,603 INFO L225 Difference]: With dead ends: 392 [2021-06-05 14:45:57,603 INFO L226 Difference]: Without dead ends: 377 [2021-06-05 14:45:57,603 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 135.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:45:57,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-06-05 14:45:57,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 177. [2021-06-05 14:45:57,606 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 14:45:57,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 512 transitions. [2021-06-05 14:45:57,607 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 512 transitions. Word has length 17 [2021-06-05 14:45:57,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:57,607 INFO L482 AbstractCegarLoop]: Abstraction has 177 states and 512 transitions. [2021-06-05 14:45:57,607 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 14:45:57,607 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 512 transitions. [2021-06-05 14:45:57,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:57,607 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:57,607 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:57,607 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-05 14:45:57,608 INFO L430 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:57,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:57,608 INFO L82 PathProgramCache]: Analyzing trace with hash -19872328, now seen corresponding path program 16 times [2021-06-05 14:45:57,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:57,608 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054759805] [2021-06-05 14:45:57,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:57,656 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 14:45:57,656 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:57,656 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054759805] [2021-06-05 14:45:57,656 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054759805] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:57,656 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:57,656 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:57,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165713297] [2021-06-05 14:45:57,656 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:57,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:57,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:57,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:57,657 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 14:45:57,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:57,794 INFO L93 Difference]: Finished difference Result 376 states and 1032 transitions. [2021-06-05 14:45:57,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:57,795 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 14:45:57,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:57,796 INFO L225 Difference]: With dead ends: 376 [2021-06-05 14:45:57,796 INFO L226 Difference]: Without dead ends: 361 [2021-06-05 14:45:57,796 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 110.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:45:57,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-06-05 14:45:57,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 174. [2021-06-05 14:45:57,799 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 14:45:57,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 498 transitions. [2021-06-05 14:45:57,800 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 498 transitions. Word has length 17 [2021-06-05 14:45:57,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:57,800 INFO L482 AbstractCegarLoop]: Abstraction has 174 states and 498 transitions. [2021-06-05 14:45:57,800 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 14:45:57,800 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 498 transitions. [2021-06-05 14:45:57,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:57,800 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:57,800 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:57,801 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-05 14:45:57,801 INFO L430 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:57,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:57,801 INFO L82 PathProgramCache]: Analyzing trace with hash -36809380, now seen corresponding path program 17 times [2021-06-05 14:45:57,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:57,801 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118158207] [2021-06-05 14:45:57,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:57,845 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 14:45:57,845 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:57,845 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118158207] [2021-06-05 14:45:57,845 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118158207] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:57,845 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:57,845 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:57,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582295347] [2021-06-05 14:45:57,846 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:57,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:57,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:57,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:57,846 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 14:45:57,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:57,965 INFO L93 Difference]: Finished difference Result 364 states and 991 transitions. [2021-06-05 14:45:57,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:57,965 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 14:45:57,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:57,966 INFO L225 Difference]: With dead ends: 364 [2021-06-05 14:45:57,966 INFO L226 Difference]: Without dead ends: 349 [2021-06-05 14:45:57,966 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 96.9ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:45:57,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-06-05 14:45:57,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 176. [2021-06-05 14:45:57,970 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 14:45:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 507 transitions. [2021-06-05 14:45:57,970 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 507 transitions. Word has length 17 [2021-06-05 14:45:57,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:57,970 INFO L482 AbstractCegarLoop]: Abstraction has 176 states and 507 transitions. [2021-06-05 14:45:57,970 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 14:45:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 507 transitions. [2021-06-05 14:45:57,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:57,971 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:57,971 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:57,971 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-05 14:45:57,971 INFO L430 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:57,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:57,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1103474456, now seen corresponding path program 18 times [2021-06-05 14:45:57,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:57,971 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554895130] [2021-06-05 14:45:57,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:58,008 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 14:45:58,008 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:58,008 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554895130] [2021-06-05 14:45:58,008 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554895130] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:58,008 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:58,008 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:58,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414169244] [2021-06-05 14:45:58,008 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:58,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:58,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:58,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:58,009 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 14:45:58,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:58,114 INFO L93 Difference]: Finished difference Result 343 states and 953 transitions. [2021-06-05 14:45:58,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:58,114 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 14:45:58,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:58,115 INFO L225 Difference]: With dead ends: 343 [2021-06-05 14:45:58,115 INFO L226 Difference]: Without dead ends: 328 [2021-06-05 14:45:58,115 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 81.7ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:45:58,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-06-05 14:45:58,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 174. [2021-06-05 14:45:58,118 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 14:45:58,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 498 transitions. [2021-06-05 14:45:58,119 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 498 transitions. Word has length 17 [2021-06-05 14:45:58,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:58,119 INFO L482 AbstractCegarLoop]: Abstraction has 174 states and 498 transitions. [2021-06-05 14:45:58,119 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 14:45:58,119 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 498 transitions. [2021-06-05 14:45:58,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:58,119 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:58,119 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:58,119 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-05 14:45:58,119 INFO L430 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:58,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:58,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1622951230, now seen corresponding path program 19 times [2021-06-05 14:45:58,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:58,120 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085389685] [2021-06-05 14:45:58,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:58,158 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 14:45:58,158 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:58,158 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085389685] [2021-06-05 14:45:58,158 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085389685] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:58,158 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:58,158 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:58,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551564374] [2021-06-05 14:45:58,158 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:58,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:58,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:58,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:58,159 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 14:45:58,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:58,241 INFO L93 Difference]: Finished difference Result 360 states and 983 transitions. [2021-06-05 14:45:58,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:58,241 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 14:45:58,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:58,242 INFO L225 Difference]: With dead ends: 360 [2021-06-05 14:45:58,242 INFO L226 Difference]: Without dead ends: 345 [2021-06-05 14:45:58,242 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 68.6ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:45:58,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-06-05 14:45:58,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 177. [2021-06-05 14:45:58,246 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 14:45:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 510 transitions. [2021-06-05 14:45:58,246 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 510 transitions. Word has length 17 [2021-06-05 14:45:58,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:58,246 INFO L482 AbstractCegarLoop]: Abstraction has 177 states and 510 transitions. [2021-06-05 14:45:58,246 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 14:45:58,246 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 510 transitions. [2021-06-05 14:45:58,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:58,247 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:58,247 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:58,247 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-05 14:45:58,247 INFO L430 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:58,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:58,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1422092646, now seen corresponding path program 20 times [2021-06-05 14:45:58,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:58,247 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100134494] [2021-06-05 14:45:58,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:58,284 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 14:45:58,284 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:58,284 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100134494] [2021-06-05 14:45:58,284 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100134494] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:58,284 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:58,284 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:58,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654374269] [2021-06-05 14:45:58,284 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:58,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:58,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:58,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:58,285 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 14:45:58,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:58,399 INFO L93 Difference]: Finished difference Result 377 states and 1017 transitions. [2021-06-05 14:45:58,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:58,399 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 14:45:58,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:58,401 INFO L225 Difference]: With dead ends: 377 [2021-06-05 14:45:58,401 INFO L226 Difference]: Without dead ends: 362 [2021-06-05 14:45:58,401 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 88.4ms TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:45:58,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-06-05 14:45:58,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 179. [2021-06-05 14:45:58,404 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 14:45:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 519 transitions. [2021-06-05 14:45:58,405 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 519 transitions. Word has length 17 [2021-06-05 14:45:58,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:58,405 INFO L482 AbstractCegarLoop]: Abstraction has 179 states and 519 transitions. [2021-06-05 14:45:58,405 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 14:45:58,405 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 519 transitions. [2021-06-05 14:45:58,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:58,405 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:58,405 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:58,405 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-05 14:45:58,406 INFO L430 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:58,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:58,406 INFO L82 PathProgramCache]: Analyzing trace with hash 203457286, now seen corresponding path program 21 times [2021-06-05 14:45:58,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:58,406 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973830825] [2021-06-05 14:45:58,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:58,449 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 14:45:58,449 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:58,449 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973830825] [2021-06-05 14:45:58,450 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973830825] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:58,450 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:58,450 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:58,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717698515] [2021-06-05 14:45:58,450 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:58,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:58,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:58,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:58,450 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 14:45:58,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:58,575 INFO L93 Difference]: Finished difference Result 354 states and 972 transitions. [2021-06-05 14:45:58,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:58,575 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 14:45:58,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:58,576 INFO L225 Difference]: With dead ends: 354 [2021-06-05 14:45:58,577 INFO L226 Difference]: Without dead ends: 339 [2021-06-05 14:45:58,577 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 96.5ms TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:45:58,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-06-05 14:45:58,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 177. [2021-06-05 14:45:58,580 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 14:45:58,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 510 transitions. [2021-06-05 14:45:58,580 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 510 transitions. Word has length 17 [2021-06-05 14:45:58,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:58,580 INFO L482 AbstractCegarLoop]: Abstraction has 177 states and 510 transitions. [2021-06-05 14:45:58,580 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 14:45:58,580 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 510 transitions. [2021-06-05 14:45:58,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:58,581 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:58,581 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:58,581 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-05 14:45:58,581 INFO L430 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:58,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:58,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1026845314, now seen corresponding path program 22 times [2021-06-05 14:45:58,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:58,581 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694976853] [2021-06-05 14:45:58,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:58,625 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 14:45:58,625 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:58,626 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694976853] [2021-06-05 14:45:58,626 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694976853] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:58,626 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:58,626 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:58,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559219346] [2021-06-05 14:45:58,626 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:58,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:58,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:58,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:58,626 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 14:45:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:58,781 INFO L93 Difference]: Finished difference Result 409 states and 1106 transitions. [2021-06-05 14:45:58,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:58,782 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 14:45:58,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:58,786 INFO L225 Difference]: With dead ends: 409 [2021-06-05 14:45:58,786 INFO L226 Difference]: Without dead ends: 394 [2021-06-05 14:45:58,786 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 124.7ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:45:58,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-06-05 14:45:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 180. [2021-06-05 14:45:58,789 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 14:45:58,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 521 transitions. [2021-06-05 14:45:58,790 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 521 transitions. Word has length 17 [2021-06-05 14:45:58,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:58,790 INFO L482 AbstractCegarLoop]: Abstraction has 180 states and 521 transitions. [2021-06-05 14:45:58,790 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 14:45:58,790 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 521 transitions. [2021-06-05 14:45:58,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:58,790 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:58,790 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:58,791 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-05 14:45:58,791 INFO L430 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:58,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:58,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1848016830, now seen corresponding path program 23 times [2021-06-05 14:45:58,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:58,791 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489456397] [2021-06-05 14:45:58,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:58,845 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 14:45:58,846 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:58,846 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489456397] [2021-06-05 14:45:58,846 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489456397] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:58,846 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:58,846 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:58,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145293552] [2021-06-05 14:45:58,846 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:58,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:58,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:58,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:58,847 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 14:45:59,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:59,020 INFO L93 Difference]: Finished difference Result 407 states and 1110 transitions. [2021-06-05 14:45:59,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:59,020 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 14:45:59,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:59,029 INFO L225 Difference]: With dead ends: 407 [2021-06-05 14:45:59,029 INFO L226 Difference]: Without dead ends: 392 [2021-06-05 14:45:59,029 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 151.6ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:45:59,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-06-05 14:45:59,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 183. [2021-06-05 14:45:59,032 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 14:45:59,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 535 transitions. [2021-06-05 14:45:59,033 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 535 transitions. Word has length 17 [2021-06-05 14:45:59,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:59,033 INFO L482 AbstractCegarLoop]: Abstraction has 183 states and 535 transitions. [2021-06-05 14:45:59,033 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 14:45:59,033 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 535 transitions. [2021-06-05 14:45:59,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:59,033 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:59,033 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:59,033 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-05 14:45:59,033 INFO L430 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:59,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:59,034 INFO L82 PathProgramCache]: Analyzing trace with hash 748230078, now seen corresponding path program 24 times [2021-06-05 14:45:59,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:59,034 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243491142] [2021-06-05 14:45:59,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:59,089 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 14:45:59,089 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:59,089 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243491142] [2021-06-05 14:45:59,089 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243491142] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:59,089 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:59,089 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:59,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850257181] [2021-06-05 14:45:59,089 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:59,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:59,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:59,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:59,090 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 14:45:59,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:59,275 INFO L93 Difference]: Finished difference Result 384 states and 1065 transitions. [2021-06-05 14:45:59,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:59,276 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 14:45:59,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:59,277 INFO L225 Difference]: With dead ends: 384 [2021-06-05 14:45:59,277 INFO L226 Difference]: Without dead ends: 369 [2021-06-05 14:45:59,277 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 154.3ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:45:59,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-06-05 14:45:59,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 177. [2021-06-05 14:45:59,280 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 14:45:59,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 510 transitions. [2021-06-05 14:45:59,281 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 510 transitions. Word has length 17 [2021-06-05 14:45:59,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:59,282 INFO L482 AbstractCegarLoop]: Abstraction has 177 states and 510 transitions. [2021-06-05 14:45:59,282 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 14:45:59,282 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 510 transitions. [2021-06-05 14:45:59,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:59,282 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:59,282 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:59,282 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-05 14:45:59,282 INFO L430 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:59,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:59,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1951172510, now seen corresponding path program 25 times [2021-06-05 14:45:59,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:59,283 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989932415] [2021-06-05 14:45:59,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:59,327 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 14:45:59,327 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:59,327 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989932415] [2021-06-05 14:45:59,327 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989932415] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:59,327 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:59,327 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:59,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245682366] [2021-06-05 14:45:59,327 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:59,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:59,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:59,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:59,328 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 14:45:59,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:59,442 INFO L93 Difference]: Finished difference Result 403 states and 1103 transitions. [2021-06-05 14:45:59,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:59,442 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 14:45:59,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:59,443 INFO L225 Difference]: With dead ends: 403 [2021-06-05 14:45:59,443 INFO L226 Difference]: Without dead ends: 388 [2021-06-05 14:45:59,444 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 89.1ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:45:59,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-06-05 14:45:59,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 180. [2021-06-05 14:45:59,447 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 14:45:59,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 525 transitions. [2021-06-05 14:45:59,448 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 525 transitions. Word has length 17 [2021-06-05 14:45:59,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:59,448 INFO L482 AbstractCegarLoop]: Abstraction has 180 states and 525 transitions. [2021-06-05 14:45:59,448 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 14:45:59,448 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 525 transitions. [2021-06-05 14:45:59,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:59,448 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:59,448 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:59,448 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-05 14:45:59,448 INFO L430 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:59,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:59,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1125159426, now seen corresponding path program 26 times [2021-06-05 14:45:59,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:59,449 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046538051] [2021-06-05 14:45:59,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:59,491 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 14:45:59,492 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:59,492 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046538051] [2021-06-05 14:45:59,492 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046538051] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:59,492 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:59,492 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:59,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281010427] [2021-06-05 14:45:59,492 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:59,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:59,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:59,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:59,493 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 14:45:59,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:59,604 INFO L93 Difference]: Finished difference Result 401 states and 1096 transitions. [2021-06-05 14:45:59,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:59,604 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 14:45:59,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:59,606 INFO L225 Difference]: With dead ends: 401 [2021-06-05 14:45:59,606 INFO L226 Difference]: Without dead ends: 386 [2021-06-05 14:45:59,606 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 85.9ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:45:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2021-06-05 14:45:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 178. [2021-06-05 14:45:59,609 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 14:45:59,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 516 transitions. [2021-06-05 14:45:59,609 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 516 transitions. Word has length 17 [2021-06-05 14:45:59,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:59,609 INFO L482 AbstractCegarLoop]: Abstraction has 178 states and 516 transitions. [2021-06-05 14:45:59,609 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 14:45:59,609 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 516 transitions. [2021-06-05 14:45:59,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:59,610 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:59,610 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:59,610 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-05 14:45:59,610 INFO L430 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:59,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:59,610 INFO L82 PathProgramCache]: Analyzing trace with hash -962111962, now seen corresponding path program 27 times [2021-06-05 14:45:59,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:59,610 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986768261] [2021-06-05 14:45:59,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:59,652 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 14:45:59,652 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:59,652 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986768261] [2021-06-05 14:45:59,652 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986768261] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:59,652 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:59,652 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:59,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308606196] [2021-06-05 14:45:59,652 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:59,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:59,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:59,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:59,653 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 14:45:59,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:59,799 INFO L93 Difference]: Finished difference Result 395 states and 1075 transitions. [2021-06-05 14:45:59,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:59,799 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 14:45:59,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:59,801 INFO L225 Difference]: With dead ends: 395 [2021-06-05 14:45:59,801 INFO L226 Difference]: Without dead ends: 380 [2021-06-05 14:45:59,801 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 114.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:45:59,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-06-05 14:45:59,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 181. [2021-06-05 14:45:59,804 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 14:45:59,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 530 transitions. [2021-06-05 14:45:59,804 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 530 transitions. Word has length 17 [2021-06-05 14:45:59,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:59,804 INFO L482 AbstractCegarLoop]: Abstraction has 181 states and 530 transitions. [2021-06-05 14:45:59,804 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 14:45:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 530 transitions. [2021-06-05 14:45:59,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:59,805 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:59,805 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:59,805 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-05 14:45:59,805 INFO L430 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:59,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:59,805 INFO L82 PathProgramCache]: Analyzing trace with hash -2132300958, now seen corresponding path program 28 times [2021-06-05 14:45:59,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:59,806 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234848201] [2021-06-05 14:45:59,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:45:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:45:59,850 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 14:45:59,850 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:45:59,850 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234848201] [2021-06-05 14:45:59,850 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234848201] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:45:59,850 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:45:59,850 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:45:59,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817320920] [2021-06-05 14:45:59,851 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:45:59,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:45:59,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:45:59,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:45:59,851 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 14:45:59,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:45:59,991 INFO L93 Difference]: Finished difference Result 379 states and 1052 transitions. [2021-06-05 14:45:59,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:45:59,991 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 14:45:59,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:45:59,993 INFO L225 Difference]: With dead ends: 379 [2021-06-05 14:45:59,993 INFO L226 Difference]: Without dead ends: 364 [2021-06-05 14:45:59,993 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 112.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:45:59,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-06-05 14:45:59,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 178. [2021-06-05 14:45:59,996 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 14:45:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 516 transitions. [2021-06-05 14:45:59,996 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 516 transitions. Word has length 17 [2021-06-05 14:45:59,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:45:59,996 INFO L482 AbstractCegarLoop]: Abstraction has 178 states and 516 transitions. [2021-06-05 14:45:59,996 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 14:45:59,996 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 516 transitions. [2021-06-05 14:45:59,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:45:59,997 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:45:59,997 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:45:59,997 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-06-05 14:45:59,997 INFO L430 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:45:59,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:45:59,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2145729286, now seen corresponding path program 29 times [2021-06-05 14:45:59,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:45:59,997 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540638369] [2021-06-05 14:45:59,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:00,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 14:46:00,036 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:00,036 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540638369] [2021-06-05 14:46:00,036 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540638369] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:00,036 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:00,036 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:00,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176350356] [2021-06-05 14:46:00,036 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:00,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:00,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:00,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:00,037 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 14:46:00,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:00,144 INFO L93 Difference]: Finished difference Result 363 states and 1003 transitions. [2021-06-05 14:46:00,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:00,144 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 14:46:00,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:00,145 INFO L225 Difference]: With dead ends: 363 [2021-06-05 14:46:00,145 INFO L226 Difference]: Without dead ends: 348 [2021-06-05 14:46:00,145 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 86.3ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:00,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-06-05 14:46:00,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 180. [2021-06-05 14:46:00,148 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 14:46:00,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 525 transitions. [2021-06-05 14:46:00,149 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 525 transitions. Word has length 17 [2021-06-05 14:46:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:00,149 INFO L482 AbstractCegarLoop]: Abstraction has 180 states and 525 transitions. [2021-06-05 14:46:00,149 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 14:46:00,149 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 525 transitions. [2021-06-05 14:46:00,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:00,149 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:00,149 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:00,149 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-05 14:46:00,149 INFO L430 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:00,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:00,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1008954174, now seen corresponding path program 30 times [2021-06-05 14:46:00,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:00,150 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840380699] [2021-06-05 14:46:00,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:00,185 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 14:46:00,185 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:00,185 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840380699] [2021-06-05 14:46:00,185 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840380699] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:00,185 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:00,185 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:00,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379389166] [2021-06-05 14:46:00,185 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:00,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:00,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:00,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:00,186 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 14:46:00,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:00,297 INFO L93 Difference]: Finished difference Result 342 states and 965 transitions. [2021-06-05 14:46:00,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:00,298 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 14:46:00,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:00,299 INFO L225 Difference]: With dead ends: 342 [2021-06-05 14:46:00,299 INFO L226 Difference]: Without dead ends: 327 [2021-06-05 14:46:00,299 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 78.4ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:00,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-06-05 14:46:00,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 177. [2021-06-05 14:46:00,301 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 14:46:00,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 510 transitions. [2021-06-05 14:46:00,302 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 510 transitions. Word has length 17 [2021-06-05 14:46:00,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:00,302 INFO L482 AbstractCegarLoop]: Abstraction has 177 states and 510 transitions. [2021-06-05 14:46:00,302 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 14:46:00,302 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 510 transitions. [2021-06-05 14:46:00,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:00,302 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:00,302 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:00,302 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-06-05 14:46:00,303 INFO L430 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:00,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:00,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1057121422, now seen corresponding path program 31 times [2021-06-05 14:46:00,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:00,303 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956789056] [2021-06-05 14:46:00,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:00,346 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 14:46:00,346 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:00,346 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956789056] [2021-06-05 14:46:00,346 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956789056] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:00,346 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:00,347 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:00,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146227479] [2021-06-05 14:46:00,347 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:00,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:00,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:00,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:00,347 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 14:46:00,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:00,497 INFO L93 Difference]: Finished difference Result 377 states and 1036 transitions. [2021-06-05 14:46:00,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:00,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 14:46:00,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:00,499 INFO L225 Difference]: With dead ends: 377 [2021-06-05 14:46:00,499 INFO L226 Difference]: Without dead ends: 362 [2021-06-05 14:46:00,499 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 129.9ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:00,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-06-05 14:46:00,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 186. [2021-06-05 14:46:00,502 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 14:46:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 546 transitions. [2021-06-05 14:46:00,502 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 546 transitions. Word has length 17 [2021-06-05 14:46:00,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:00,502 INFO L482 AbstractCegarLoop]: Abstraction has 186 states and 546 transitions. [2021-06-05 14:46:00,502 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 14:46:00,502 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 546 transitions. [2021-06-05 14:46:00,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:00,503 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:00,503 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:00,503 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-06-05 14:46:00,503 INFO L430 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:00,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:00,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2030292802, now seen corresponding path program 32 times [2021-06-05 14:46:00,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:00,503 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282370759] [2021-06-05 14:46:00,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:00,554 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 14:46:00,554 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:00,554 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282370759] [2021-06-05 14:46:00,554 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282370759] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:00,554 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:00,554 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:00,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019222536] [2021-06-05 14:46:00,554 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:00,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:00,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:00,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:00,555 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 14:46:00,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:00,721 INFO L93 Difference]: Finished difference Result 386 states and 1062 transitions. [2021-06-05 14:46:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:00,721 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 14:46:00,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:00,722 INFO L225 Difference]: With dead ends: 386 [2021-06-05 14:46:00,722 INFO L226 Difference]: Without dead ends: 371 [2021-06-05 14:46:00,723 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 147.8ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:00,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-06-05 14:46:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 189. [2021-06-05 14:46:00,725 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 14:46:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 560 transitions. [2021-06-05 14:46:00,726 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 560 transitions. Word has length 17 [2021-06-05 14:46:00,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:00,726 INFO L482 AbstractCegarLoop]: Abstraction has 189 states and 560 transitions. [2021-06-05 14:46:00,726 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 14:46:00,726 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 560 transitions. [2021-06-05 14:46:00,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:00,726 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:00,726 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:00,726 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-06-05 14:46:00,727 INFO L430 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:00,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:00,727 INFO L82 PathProgramCache]: Analyzing trace with hash 565954106, now seen corresponding path program 33 times [2021-06-05 14:46:00,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:00,727 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295146430] [2021-06-05 14:46:00,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:00,783 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 14:46:00,784 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:00,784 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295146430] [2021-06-05 14:46:00,784 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295146430] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:00,784 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:00,784 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:00,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881156158] [2021-06-05 14:46:00,784 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:00,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:00,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:00,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:00,785 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 14:46:00,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:00,971 INFO L93 Difference]: Finished difference Result 393 states and 1078 transitions. [2021-06-05 14:46:00,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46: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 14:46:00,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:00,973 INFO L225 Difference]: With dead ends: 393 [2021-06-05 14:46:00,973 INFO L226 Difference]: Without dead ends: 378 [2021-06-05 14:46:00,973 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 177.8ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:00,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-06-05 14:46:00,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 181. [2021-06-05 14:46:00,976 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 14:46:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 528 transitions. [2021-06-05 14:46:00,976 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 528 transitions. Word has length 17 [2021-06-05 14:46:00,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:00,976 INFO L482 AbstractCegarLoop]: Abstraction has 181 states and 528 transitions. [2021-06-05 14:46:00,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 14:46:00,976 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 528 transitions. [2021-06-05 14:46:00,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:00,977 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:00,977 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:00,977 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-06-05 14:46:00,977 INFO L430 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:00,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:00,977 INFO L82 PathProgramCache]: Analyzing trace with hash 2049664750, now seen corresponding path program 34 times [2021-06-05 14:46:00,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:00,977 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366675106] [2021-06-05 14:46:00,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:01,014 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 14:46:01,014 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:01,014 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366675106] [2021-06-05 14:46:01,014 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366675106] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:01,014 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:01,014 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:01,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700088272] [2021-06-05 14:46:01,014 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:01,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:01,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:01,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:01,015 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 14:46:01,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:01,115 INFO L93 Difference]: Finished difference Result 438 states and 1184 transitions. [2021-06-05 14:46:01,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:01,115 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 14:46:01,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:01,117 INFO L225 Difference]: With dead ends: 438 [2021-06-05 14:46:01,117 INFO L226 Difference]: Without dead ends: 423 [2021-06-05 14:46:01,117 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 74.8ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:01,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-06-05 14:46:01,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 185. [2021-06-05 14:46:01,120 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 14:46:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 542 transitions. [2021-06-05 14:46:01,121 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 542 transitions. Word has length 17 [2021-06-05 14:46:01,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:01,121 INFO L482 AbstractCegarLoop]: Abstraction has 185 states and 542 transitions. [2021-06-05 14:46:01,121 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 14:46:01,121 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 542 transitions. [2021-06-05 14:46:01,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:01,121 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:01,121 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:01,122 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-06-05 14:46:01,122 INFO L430 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:01,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:01,125 INFO L82 PathProgramCache]: Analyzing trace with hash 278392308, now seen corresponding path program 35 times [2021-06-05 14:46:01,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:01,125 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132993004] [2021-06-05 14:46:01,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:01,162 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 14:46:01,162 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:01,162 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132993004] [2021-06-05 14:46:01,162 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132993004] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:01,162 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:01,162 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:01,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887133277] [2021-06-05 14:46:01,162 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:01,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:01,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:01,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:01,163 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 14:46:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:01,272 INFO L93 Difference]: Finished difference Result 433 states and 1175 transitions. [2021-06-05 14:46:01,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:01,272 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 14:46:01,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:01,273 INFO L225 Difference]: With dead ends: 433 [2021-06-05 14:46:01,273 INFO L226 Difference]: Without dead ends: 418 [2021-06-05 14:46:01,274 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 87.7ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:01,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-06-05 14:46:01,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 187. [2021-06-05 14:46:01,277 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 14:46:01,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 551 transitions. [2021-06-05 14:46:01,277 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 551 transitions. Word has length 17 [2021-06-05 14:46:01,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:01,277 INFO L482 AbstractCegarLoop]: Abstraction has 187 states and 551 transitions. [2021-06-05 14:46:01,277 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 14:46:01,277 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 551 transitions. [2021-06-05 14:46:01,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:01,278 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:01,278 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:01,278 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-06-05 14:46:01,278 INFO L430 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:01,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:01,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1347392328, now seen corresponding path program 36 times [2021-06-05 14:46:01,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:01,278 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748357489] [2021-06-05 14:46:01,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:01,321 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 14:46:01,322 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:01,322 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748357489] [2021-06-05 14:46:01,322 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748357489] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:01,322 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:01,322 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:01,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074819961] [2021-06-05 14:46:01,322 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:01,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:01,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:01,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:01,323 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 14:46:01,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:01,432 INFO L93 Difference]: Finished difference Result 416 states and 1145 transitions. [2021-06-05 14:46:01,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:01,432 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 14:46:01,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:01,433 INFO L225 Difference]: With dead ends: 416 [2021-06-05 14:46:01,433 INFO L226 Difference]: Without dead ends: 401 [2021-06-05 14:46:01,433 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 84.3ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:01,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2021-06-05 14:46:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 181. [2021-06-05 14:46:01,436 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 14:46:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 528 transitions. [2021-06-05 14:46:01,437 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 528 transitions. Word has length 17 [2021-06-05 14:46:01,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:01,437 INFO L482 AbstractCegarLoop]: Abstraction has 181 states and 528 transitions. [2021-06-05 14:46:01,437 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 14:46:01,437 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 528 transitions. [2021-06-05 14:46:01,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:01,437 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:01,437 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:01,437 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-06-05 14:46:01,437 INFO L430 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:01,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:01,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1040697164, now seen corresponding path program 37 times [2021-06-05 14:46:01,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:01,438 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304686938] [2021-06-05 14:46:01,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:01,484 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 14:46:01,484 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:01,484 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304686938] [2021-06-05 14:46:01,484 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304686938] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:01,484 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:01,484 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:01,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992980052] [2021-06-05 14:46:01,485 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:01,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:01,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:01,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:01,485 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 14:46:01,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:01,603 INFO L93 Difference]: Finished difference Result 437 states and 1201 transitions. [2021-06-05 14:46:01,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:01,603 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 14:46:01,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:01,605 INFO L225 Difference]: With dead ends: 437 [2021-06-05 14:46:01,605 INFO L226 Difference]: Without dead ends: 422 [2021-06-05 14:46:01,605 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 91.1ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:01,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-06-05 14:46:01,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 184. [2021-06-05 14:46:01,608 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 14:46:01,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 543 transitions. [2021-06-05 14:46:01,608 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 543 transitions. Word has length 17 [2021-06-05 14:46:01,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:01,608 INFO L482 AbstractCegarLoop]: Abstraction has 184 states and 543 transitions. [2021-06-05 14:46:01,608 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 14:46:01,609 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 543 transitions. [2021-06-05 14:46:01,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:01,609 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:01,609 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:01,609 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-06-05 14:46:01,609 INFO L430 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:01,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:01,609 INFO L82 PathProgramCache]: Analyzing trace with hash 2035634772, now seen corresponding path program 38 times [2021-06-05 14:46:01,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:01,609 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793609251] [2021-06-05 14:46:01,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:01,660 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 14:46:01,660 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:01,660 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793609251] [2021-06-05 14:46:01,660 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793609251] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:01,660 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:01,660 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:01,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555682728] [2021-06-05 14:46:01,661 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:01,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:01,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:01,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:01,661 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 14:46:01,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:01,765 INFO L93 Difference]: Finished difference Result 435 states and 1194 transitions. [2021-06-05 14:46:01,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:01,765 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 14:46:01,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:01,767 INFO L225 Difference]: With dead ends: 435 [2021-06-05 14:46:01,767 INFO L226 Difference]: Without dead ends: 420 [2021-06-05 14:46:01,767 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 95.1ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:01,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2021-06-05 14:46:01,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 182. [2021-06-05 14:46:01,770 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 14:46:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 534 transitions. [2021-06-05 14:46:01,770 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 534 transitions. Word has length 17 [2021-06-05 14:46:01,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:01,770 INFO L482 AbstractCegarLoop]: Abstraction has 182 states and 534 transitions. [2021-06-05 14:46:01,770 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 14:46:01,770 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 534 transitions. [2021-06-05 14:46:01,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:01,770 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:01,771 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:01,771 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-06-05 14:46:01,771 INFO L430 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:01,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:01,771 INFO L82 PathProgramCache]: Analyzing trace with hash -51636616, now seen corresponding path program 39 times [2021-06-05 14:46:01,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:01,771 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429348918] [2021-06-05 14:46:01,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:01,817 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 14:46:01,817 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:01,818 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429348918] [2021-06-05 14:46:01,818 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429348918] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:01,818 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:01,818 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:01,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957699258] [2021-06-05 14:46:01,818 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:01,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:01,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:01,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:01,818 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 14:46:01,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:01,953 INFO L93 Difference]: Finished difference Result 468 states and 1258 transitions. [2021-06-05 14:46:01,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:01,954 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 14:46:01,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:01,955 INFO L225 Difference]: With dead ends: 468 [2021-06-05 14:46:01,955 INFO L226 Difference]: Without dead ends: 453 [2021-06-05 14:46:01,955 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 105.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:01,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-06-05 14:46:01,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 185. [2021-06-05 14:46:01,959 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 14:46:01,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 548 transitions. [2021-06-05 14:46:01,959 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 548 transitions. Word has length 17 [2021-06-05 14:46:01,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:01,959 INFO L482 AbstractCegarLoop]: Abstraction has 185 states and 548 transitions. [2021-06-05 14:46:01,959 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 14:46:01,959 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 548 transitions. [2021-06-05 14:46:01,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:01,960 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:01,960 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:01,960 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-06-05 14:46:01,960 INFO L430 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:01,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:01,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1221825612, now seen corresponding path program 40 times [2021-06-05 14:46:01,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:01,960 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204661352] [2021-06-05 14:46:01,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:02,017 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 14:46:02,017 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:02,017 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204661352] [2021-06-05 14:46:02,017 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204661352] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:02,017 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:02,017 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:02,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148019068] [2021-06-05 14:46:02,017 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:02,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:02,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:02,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:02,018 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 14:46:02,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:02,158 INFO L93 Difference]: Finished difference Result 452 states and 1235 transitions. [2021-06-05 14:46:02,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:02,158 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 14:46:02,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:02,160 INFO L225 Difference]: With dead ends: 452 [2021-06-05 14:46:02,160 INFO L226 Difference]: Without dead ends: 437 [2021-06-05 14:46:02,160 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 111.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:02,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-06-05 14:46:02,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 182. [2021-06-05 14:46:02,163 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 14:46:02,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 534 transitions. [2021-06-05 14:46:02,163 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 534 transitions. Word has length 17 [2021-06-05 14:46:02,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:02,163 INFO L482 AbstractCegarLoop]: Abstraction has 182 states and 534 transitions. [2021-06-05 14:46:02,163 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 14:46:02,163 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 534 transitions. [2021-06-05 14:46:02,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:02,163 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:02,164 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:02,164 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-06-05 14:46:02,164 INFO L430 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:02,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:02,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1238762664, now seen corresponding path program 41 times [2021-06-05 14:46:02,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:02,164 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214206150] [2021-06-05 14:46:02,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:02,210 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 14:46:02,210 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:02,210 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214206150] [2021-06-05 14:46:02,210 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214206150] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:02,210 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:02,210 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:02,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279669925] [2021-06-05 14:46:02,210 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:02,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:02,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:02,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:02,211 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 14:46:02,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:02,328 INFO L93 Difference]: Finished difference Result 446 states and 1215 transitions. [2021-06-05 14:46:02,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:02,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 14:46:02,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:02,330 INFO L225 Difference]: With dead ends: 446 [2021-06-05 14:46:02,330 INFO L226 Difference]: Without dead ends: 431 [2021-06-05 14:46:02,330 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 92.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:02,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-06-05 14:46:02,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 184. [2021-06-05 14:46:02,333 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 14:46:02,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 543 transitions. [2021-06-05 14:46:02,333 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 543 transitions. Word has length 17 [2021-06-05 14:46:02,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:02,333 INFO L482 AbstractCegarLoop]: Abstraction has 184 states and 543 transitions. [2021-06-05 14:46:02,333 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 14:46:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 543 transitions. [2021-06-05 14:46:02,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:02,334 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:02,334 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:02,334 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-06-05 14:46:02,334 INFO L430 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:02,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:02,334 INFO L82 PathProgramCache]: Analyzing trace with hash -98478828, now seen corresponding path program 42 times [2021-06-05 14:46:02,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:02,334 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129582299] [2021-06-05 14:46:02,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:02,371 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 14:46:02,371 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:02,371 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129582299] [2021-06-05 14:46:02,371 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129582299] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:02,371 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:02,371 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:02,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530672526] [2021-06-05 14:46:02,371 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:02,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:02,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:02,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:02,372 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 14:46:02,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:02,484 INFO L93 Difference]: Finished difference Result 425 states and 1177 transitions. [2021-06-05 14:46:02,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:02,485 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 14:46:02,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:02,485 INFO L225 Difference]: With dead ends: 425 [2021-06-05 14:46:02,485 INFO L226 Difference]: Without dead ends: 410 [2021-06-05 14:46:02,486 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 79.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:02,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-06-05 14:46:02,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 179. [2021-06-05 14:46:02,488 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 14:46:02,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 518 transitions. [2021-06-05 14:46:02,489 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 518 transitions. Word has length 17 [2021-06-05 14:46:02,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:02,489 INFO L482 AbstractCegarLoop]: Abstraction has 179 states and 518 transitions. [2021-06-05 14:46:02,489 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 14:46:02,489 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 518 transitions. [2021-06-05 14:46:02,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:02,489 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:02,489 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:02,489 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-06-05 14:46:02,489 INFO L430 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:02,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:02,490 INFO L82 PathProgramCache]: Analyzing trace with hash -485249606, now seen corresponding path program 43 times [2021-06-05 14:46:02,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:02,490 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126184356] [2021-06-05 14:46:02,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:02,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 14:46:02,534 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:02,534 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126184356] [2021-06-05 14:46:02,534 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126184356] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:02,534 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:02,534 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:02,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212615757] [2021-06-05 14:46:02,535 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:02,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:02,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:02,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:02,535 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 14:46:02,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:02,618 INFO L93 Difference]: Finished difference Result 323 states and 889 transitions. [2021-06-05 14:46:02,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:02,618 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 14:46:02,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:02,619 INFO L225 Difference]: With dead ends: 323 [2021-06-05 14:46:02,619 INFO L226 Difference]: Without dead ends: 308 [2021-06-05 14:46:02,619 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 79.9ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:02,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-06-05 14:46:02,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 187. [2021-06-05 14:46:02,621 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 14:46:02,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 542 transitions. [2021-06-05 14:46:02,622 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 542 transitions. Word has length 17 [2021-06-05 14:46:02,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:02,622 INFO L482 AbstractCegarLoop]: Abstraction has 187 states and 542 transitions. [2021-06-05 14:46:02,622 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 14:46:02,622 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 542 transitions. [2021-06-05 14:46:02,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:02,622 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:02,622 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:02,622 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-06-05 14:46:02,622 INFO L430 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:02,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:02,623 INFO L82 PathProgramCache]: Analyzing trace with hash 2038445248, now seen corresponding path program 44 times [2021-06-05 14:46:02,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:02,623 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14422118] [2021-06-05 14:46:02,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:02,661 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 14:46:02,661 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:02,661 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14422118] [2021-06-05 14:46:02,661 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14422118] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:02,661 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:02,661 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:02,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861985340] [2021-06-05 14:46:02,661 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:02,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:02,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:02,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:02,662 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 14:46:02,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:02,786 INFO L93 Difference]: Finished difference Result 353 states and 951 transitions. [2021-06-05 14:46:02,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:02,787 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 14:46:02,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:02,787 INFO L225 Difference]: With dead ends: 353 [2021-06-05 14:46:02,787 INFO L226 Difference]: Without dead ends: 338 [2021-06-05 14:46:02,787 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 102.6ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:02,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-06-05 14:46:02,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 189. [2021-06-05 14:46:02,790 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 14:46:02,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 551 transitions. [2021-06-05 14:46:02,790 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 551 transitions. Word has length 17 [2021-06-05 14:46:02,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:02,791 INFO L482 AbstractCegarLoop]: Abstraction has 189 states and 551 transitions. [2021-06-05 14:46:02,791 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 14:46:02,791 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 551 transitions. [2021-06-05 14:46:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:02,791 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:02,791 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:02,791 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-06-05 14:46:02,791 INFO L430 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:02,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:02,791 INFO L82 PathProgramCache]: Analyzing trace with hash 412660612, now seen corresponding path program 45 times [2021-06-05 14:46:02,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:02,792 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625874386] [2021-06-05 14:46:02,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:02,834 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 14:46:02,835 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:02,835 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625874386] [2021-06-05 14:46:02,835 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625874386] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:02,835 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:02,835 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:02,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075891740] [2021-06-05 14:46:02,835 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:02,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:02,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:02,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:02,835 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 14:46:02,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:02,953 INFO L93 Difference]: Finished difference Result 336 states and 921 transitions. [2021-06-05 14:46:02,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:02,954 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 14:46:02,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:02,954 INFO L225 Difference]: With dead ends: 336 [2021-06-05 14:46:02,954 INFO L226 Difference]: Without dead ends: 321 [2021-06-05 14:46:02,954 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 95.3ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:02,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-06-05 14:46:02,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 183. [2021-06-05 14:46:02,958 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 14:46:02,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 528 transitions. [2021-06-05 14:46:02,958 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 528 transitions. Word has length 17 [2021-06-05 14:46:02,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:02,958 INFO L482 AbstractCegarLoop]: Abstraction has 183 states and 528 transitions. [2021-06-05 14:46:02,959 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 14:46:02,959 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 528 transitions. [2021-06-05 14:46:02,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:02,959 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:02,959 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:02,959 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-06-05 14:46:02,959 INFO L430 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:02,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:02,959 INFO L82 PathProgramCache]: Analyzing trace with hash 379489126, now seen corresponding path program 46 times [2021-06-05 14:46:02,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:02,959 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716257345] [2021-06-05 14:46:02,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:03,003 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 14:46:03,003 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:03,003 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716257345] [2021-06-05 14:46:03,003 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716257345] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:03,003 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:03,003 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:03,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366483072] [2021-06-05 14:46:03,004 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:03,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:03,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:03,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:03,004 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 14:46:03,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:03,095 INFO L93 Difference]: Finished difference Result 324 states and 889 transitions. [2021-06-05 14:46:03,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:03,096 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 14:46:03,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:03,096 INFO L225 Difference]: With dead ends: 324 [2021-06-05 14:46:03,096 INFO L226 Difference]: Without dead ends: 309 [2021-06-05 14:46:03,096 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 81.9ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:03,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-06-05 14:46:03,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 189. [2021-06-05 14:46:03,099 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 14:46:03,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 543 transitions. [2021-06-05 14:46:03,099 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 543 transitions. Word has length 17 [2021-06-05 14:46:03,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:03,099 INFO L482 AbstractCegarLoop]: Abstraction has 189 states and 543 transitions. [2021-06-05 14:46:03,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 14:46:03,099 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 543 transitions. [2021-06-05 14:46:03,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:03,100 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:03,100 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:03,100 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-06-05 14:46:03,100 INFO L430 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:03,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:03,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1252190110, now seen corresponding path program 47 times [2021-06-05 14:46:03,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:03,100 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545953416] [2021-06-05 14:46:03,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:03,147 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 14:46:03,148 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:03,148 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545953416] [2021-06-05 14:46:03,148 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545953416] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:03,148 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:03,148 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:03,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13452995] [2021-06-05 14:46:03,148 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:03,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:03,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:03,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:03,149 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 14:46:03,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:03,267 INFO L93 Difference]: Finished difference Result 354 states and 954 transitions. [2021-06-05 14:46:03,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:03,267 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 14:46:03,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:03,268 INFO L225 Difference]: With dead ends: 354 [2021-06-05 14:46:03,268 INFO L226 Difference]: Without dead ends: 339 [2021-06-05 14:46:03,268 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 95.4ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:03,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-06-05 14:46:03,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 191. [2021-06-05 14:46:03,271 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 14:46:03,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 552 transitions. [2021-06-05 14:46:03,271 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 552 transitions. Word has length 17 [2021-06-05 14:46:03,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:03,271 INFO L482 AbstractCegarLoop]: Abstraction has 191 states and 552 transitions. [2021-06-05 14:46:03,271 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 14:46:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 552 transitions. [2021-06-05 14:46:03,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:03,272 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:03,272 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:03,272 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-06-05 14:46:03,272 INFO L430 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:03,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:03,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1416992550, now seen corresponding path program 48 times [2021-06-05 14:46:03,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:03,272 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758035516] [2021-06-05 14:46:03,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:03,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 14:46:03,312 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:03,313 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758035516] [2021-06-05 14:46:03,313 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758035516] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:03,313 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:03,313 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:03,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824800785] [2021-06-05 14:46:03,313 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:03,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:03,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:03,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:03,314 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 14:46:03,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:03,421 INFO L93 Difference]: Finished difference Result 333 states and 916 transitions. [2021-06-05 14:46:03,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:03,421 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 14:46:03,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:03,422 INFO L225 Difference]: With dead ends: 333 [2021-06-05 14:46:03,422 INFO L226 Difference]: Without dead ends: 318 [2021-06-05 14:46:03,422 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 87.4ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:03,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-06-05 14:46:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 189. [2021-06-05 14:46:03,425 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 14:46:03,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 543 transitions. [2021-06-05 14:46:03,435 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 543 transitions. Word has length 17 [2021-06-05 14:46:03,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:03,435 INFO L482 AbstractCegarLoop]: Abstraction has 189 states and 543 transitions. [2021-06-05 14:46:03,435 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 14:46:03,436 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 543 transitions. [2021-06-05 14:46:03,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:03,436 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:03,436 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:03,436 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-06-05 14:46:03,436 INFO L430 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:03,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:03,436 INFO L82 PathProgramCache]: Analyzing trace with hash -167418646, now seen corresponding path program 49 times [2021-06-05 14:46:03,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:03,437 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135500472] [2021-06-05 14:46:03,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:03,480 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 14:46:03,480 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:03,480 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135500472] [2021-06-05 14:46:03,481 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135500472] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:03,481 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:03,481 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:03,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714651230] [2021-06-05 14:46:03,481 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:03,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:03,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:03,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:03,482 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 14:46:03,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:03,586 INFO L93 Difference]: Finished difference Result 386 states and 1068 transitions. [2021-06-05 14:46:03,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:03,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 14:46:03,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:03,587 INFO L225 Difference]: With dead ends: 386 [2021-06-05 14:46:03,587 INFO L226 Difference]: Without dead ends: 371 [2021-06-05 14:46:03,587 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 86.2ms TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:03,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-06-05 14:46:03,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 194. [2021-06-05 14:46:03,590 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 14:46:03,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 564 transitions. [2021-06-05 14:46:03,591 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 564 transitions. Word has length 17 [2021-06-05 14:46:03,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:03,591 INFO L482 AbstractCegarLoop]: Abstraction has 194 states and 564 transitions. [2021-06-05 14:46:03,591 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 14:46:03,591 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 564 transitions. [2021-06-05 14:46:03,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:03,591 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:03,591 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:03,591 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-06-05 14:46:03,591 INFO L430 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:03,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:03,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1386054006, now seen corresponding path program 50 times [2021-06-05 14:46:03,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:03,592 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873562437] [2021-06-05 14:46:03,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:03,636 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 14:46:03,636 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:03,636 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873562437] [2021-06-05 14:46:03,636 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873562437] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:03,636 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:03,636 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:03,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652242522] [2021-06-05 14:46:03,637 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:03,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:03,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:03,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:03,637 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 14:46:03,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:03,751 INFO L93 Difference]: Finished difference Result 390 states and 1074 transitions. [2021-06-05 14:46:03,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:03,752 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 14:46:03,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:03,752 INFO L225 Difference]: With dead ends: 390 [2021-06-05 14:46:03,752 INFO L226 Difference]: Without dead ends: 375 [2021-06-05 14:46:03,752 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 92.1ms TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:03,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-06-05 14:46:03,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 192. [2021-06-05 14:46:03,755 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 14:46:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 555 transitions. [2021-06-05 14:46:03,755 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 555 transitions. Word has length 17 [2021-06-05 14:46:03,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:03,756 INFO L482 AbstractCegarLoop]: Abstraction has 192 states and 555 transitions. [2021-06-05 14:46:03,756 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 14:46:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 555 transitions. [2021-06-05 14:46:03,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:03,756 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:03,756 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:03,756 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-06-05 14:46:03,756 INFO L430 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:03,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:03,756 INFO L82 PathProgramCache]: Analyzing trace with hash -310342850, now seen corresponding path program 51 times [2021-06-05 14:46:03,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:03,757 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201326149] [2021-06-05 14:46:03,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:03,819 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 14:46:03,819 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:03,819 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201326149] [2021-06-05 14:46:03,819 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201326149] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:03,820 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:03,820 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:03,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182478176] [2021-06-05 14:46:03,820 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:03,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:03,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:03,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:03,820 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 14:46:03,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:03,914 INFO L93 Difference]: Finished difference Result 386 states and 1060 transitions. [2021-06-05 14:46:03,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:03,914 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 14:46:03,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:03,915 INFO L225 Difference]: With dead ends: 386 [2021-06-05 14:46:03,915 INFO L226 Difference]: Without dead ends: 371 [2021-06-05 14:46:03,915 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 91.2ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:03,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-06-05 14:46:03,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 192. [2021-06-05 14:46:03,918 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 14:46:03,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 555 transitions. [2021-06-05 14:46:03,918 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 555 transitions. Word has length 17 [2021-06-05 14:46:03,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:03,918 INFO L482 AbstractCegarLoop]: Abstraction has 192 states and 555 transitions. [2021-06-05 14:46:03,918 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 14:46:03,918 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 555 transitions. [2021-06-05 14:46:03,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:03,919 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:03,919 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:03,919 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-06-05 14:46:03,919 INFO L430 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:03,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:03,919 INFO L82 PathProgramCache]: Analyzing trace with hash -548101402, now seen corresponding path program 52 times [2021-06-05 14:46:03,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:03,919 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118862367] [2021-06-05 14:46:03,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:03,966 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 14:46:03,966 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:03,966 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118862367] [2021-06-05 14:46:03,966 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118862367] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:03,966 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:03,966 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:03,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141943036] [2021-06-05 14:46:03,966 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:03,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:03,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:03,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:03,967 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 14:46:04,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:04,088 INFO L93 Difference]: Finished difference Result 464 states and 1256 transitions. [2021-06-05 14:46:04,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:04,088 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 14:46:04,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:04,089 INFO L225 Difference]: With dead ends: 464 [2021-06-05 14:46:04,089 INFO L226 Difference]: Without dead ends: 449 [2021-06-05 14:46:04,089 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 91.2ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:04,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-06-05 14:46:04,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 195. [2021-06-05 14:46:04,092 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 14:46:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 570 transitions. [2021-06-05 14:46:04,093 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 570 transitions. Word has length 17 [2021-06-05 14:46:04,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:04,093 INFO L482 AbstractCegarLoop]: Abstraction has 195 states and 570 transitions. [2021-06-05 14:46:04,093 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 14:46:04,093 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 570 transitions. [2021-06-05 14:46:04,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:04,093 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:04,093 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:04,093 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-06-05 14:46:04,094 INFO L430 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:04,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:04,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1766736762, now seen corresponding path program 53 times [2021-06-05 14:46:04,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:04,094 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207109082] [2021-06-05 14:46:04,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:04,134 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 14:46:04,134 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:04,134 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207109082] [2021-06-05 14:46:04,134 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207109082] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:04,134 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:04,134 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:04,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033893887] [2021-06-05 14:46:04,134 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:04,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:04,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:04,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:04,135 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 14:46:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:04,261 INFO L93 Difference]: Finished difference Result 468 states and 1262 transitions. [2021-06-05 14:46:04,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:04,261 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 14:46:04,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:04,262 INFO L225 Difference]: With dead ends: 468 [2021-06-05 14:46:04,262 INFO L226 Difference]: Without dead ends: 453 [2021-06-05 14:46:04,262 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 89.9ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:04,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-06-05 14:46:04,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 193. [2021-06-05 14:46:04,266 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 14:46:04,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 561 transitions. [2021-06-05 14:46:04,266 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 561 transitions. Word has length 17 [2021-06-05 14:46:04,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:04,266 INFO L482 AbstractCegarLoop]: Abstraction has 193 states and 561 transitions. [2021-06-05 14:46:04,266 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 14:46:04,266 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 561 transitions. [2021-06-05 14:46:04,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:04,267 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:04,267 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:04,267 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-06-05 14:46:04,267 INFO L430 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:04,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:04,267 INFO L82 PathProgramCache]: Analyzing trace with hash 440959146, now seen corresponding path program 54 times [2021-06-05 14:46:04,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:04,267 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282208712] [2021-06-05 14:46:04,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:04,310 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 14:46:04,310 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:04,311 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282208712] [2021-06-05 14:46:04,311 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282208712] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:04,311 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:04,311 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:04,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373616595] [2021-06-05 14:46:04,311 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:04,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:04,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:04,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:04,311 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 14:46:04,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:04,478 INFO L93 Difference]: Finished difference Result 431 states and 1182 transitions. [2021-06-05 14:46:04,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:04,479 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 14:46:04,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:04,479 INFO L225 Difference]: With dead ends: 431 [2021-06-05 14:46:04,479 INFO L226 Difference]: Without dead ends: 416 [2021-06-05 14:46:04,480 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 143.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:04,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-06-05 14:46:04,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 196. [2021-06-05 14:46:04,483 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 14:46:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 575 transitions. [2021-06-05 14:46:04,483 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 575 transitions. Word has length 17 [2021-06-05 14:46:04,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:04,483 INFO L482 AbstractCegarLoop]: Abstraction has 196 states and 575 transitions. [2021-06-05 14:46:04,483 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 14:46:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 575 transitions. [2021-06-05 14:46:04,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:04,484 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:04,484 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:04,484 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-06-05 14:46:04,484 INFO L430 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:04,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:04,484 INFO L82 PathProgramCache]: Analyzing trace with hash -729229850, now seen corresponding path program 55 times [2021-06-05 14:46:04,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:04,484 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863697441] [2021-06-05 14:46:04,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:04,522 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 14:46:04,522 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:04,522 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863697441] [2021-06-05 14:46:04,522 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863697441] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:04,522 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:04,522 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:04,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787548070] [2021-06-05 14:46:04,523 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:04,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:04,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:04,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:04,523 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 14:46:04,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:04,654 INFO L93 Difference]: Finished difference Result 415 states and 1159 transitions. [2021-06-05 14:46:04,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:04,655 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 14:46:04,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:04,655 INFO L225 Difference]: With dead ends: 415 [2021-06-05 14:46:04,655 INFO L226 Difference]: Without dead ends: 400 [2021-06-05 14:46:04,656 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 104.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:04,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-06-05 14:46:04,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 193. [2021-06-05 14:46:04,658 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 14:46:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 561 transitions. [2021-06-05 14:46:04,659 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 561 transitions. Word has length 17 [2021-06-05 14:46:04,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:04,659 INFO L482 AbstractCegarLoop]: Abstraction has 193 states and 561 transitions. [2021-06-05 14:46:04,659 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 14:46:04,659 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 561 transitions. [2021-06-05 14:46:04,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:04,659 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:04,659 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:04,660 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-06-05 14:46:04,660 INFO L430 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:04,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:04,660 INFO L82 PathProgramCache]: Analyzing trace with hash -746166902, now seen corresponding path program 56 times [2021-06-05 14:46:04,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:04,660 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913832076] [2021-06-05 14:46:04,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:04,702 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 14:46:04,702 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:04,702 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913832076] [2021-06-05 14:46:04,702 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913832076] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:04,702 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:04,702 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:04,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111252446] [2021-06-05 14:46:04,702 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:04,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:04,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:04,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:04,703 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 14:46:04,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:04,821 INFO L93 Difference]: Finished difference Result 449 states and 1229 transitions. [2021-06-05 14:46:04,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:04,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 14:46:04,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:04,822 INFO L225 Difference]: With dead ends: 449 [2021-06-05 14:46:04,822 INFO L226 Difference]: Without dead ends: 434 [2021-06-05 14:46:04,823 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 87.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:04,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-06-05 14:46:04,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 195. [2021-06-05 14:46:04,826 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 14:46:04,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 570 transitions. [2021-06-05 14:46:04,826 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 570 transitions. Word has length 17 [2021-06-05 14:46:04,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:04,826 INFO L482 AbstractCegarLoop]: Abstraction has 195 states and 570 transitions. [2021-06-05 14:46:04,826 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 14:46:04,826 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 570 transitions. [2021-06-05 14:46:04,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:04,827 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:04,827 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:04,827 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-06-05 14:46:04,829 INFO L430 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:04,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:04,829 INFO L82 PathProgramCache]: Analyzing trace with hash 394116934, now seen corresponding path program 57 times [2021-06-05 14:46:04,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:04,829 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695389354] [2021-06-05 14:46:04,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:04,866 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 14:46:04,866 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:04,866 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695389354] [2021-06-05 14:46:04,866 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695389354] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:04,866 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:04,866 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:04,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563410079] [2021-06-05 14:46:04,866 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:04,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:04,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:04,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:04,867 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 14:46:04,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:04,981 INFO L93 Difference]: Finished difference Result 428 states and 1191 transitions. [2021-06-05 14:46:04,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:04,981 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 14:46:04,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:04,982 INFO L225 Difference]: With dead ends: 428 [2021-06-05 14:46:04,982 INFO L226 Difference]: Without dead ends: 413 [2021-06-05 14:46:04,982 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 82.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:04,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-06-05 14:46:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 192. [2021-06-05 14:46:04,985 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 14:46:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 555 transitions. [2021-06-05 14:46:04,985 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 555 transitions. Word has length 17 [2021-06-05 14:46:04,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:04,985 INFO L482 AbstractCegarLoop]: Abstraction has 192 states and 555 transitions. [2021-06-05 14:46:04,985 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 14:46:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 555 transitions. [2021-06-05 14:46:04,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:04,986 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:04,986 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:04,986 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-06-05 14:46:04,986 INFO L430 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:04,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:04,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1262551738, now seen corresponding path program 58 times [2021-06-05 14:46:04,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:04,986 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608808269] [2021-06-05 14:46:04,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:05,027 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 14:46:05,027 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:05,027 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608808269] [2021-06-05 14:46:05,027 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608808269] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:05,027 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:05,027 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:05,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089052800] [2021-06-05 14:46:05,028 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:05,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:05,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:05,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:05,028 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 14:46:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:05,122 INFO L93 Difference]: Finished difference Result 429 states and 1161 transitions. [2021-06-05 14:46:05,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:05,122 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 14:46:05,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:05,123 INFO L225 Difference]: With dead ends: 429 [2021-06-05 14:46:05,123 INFO L226 Difference]: Without dead ends: 414 [2021-06-05 14:46:05,123 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 79.2ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:05,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-06-05 14:46:05,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 194. [2021-06-05 14:46:05,126 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 14:46:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 562 transitions. [2021-06-05 14:46:05,126 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 562 transitions. Word has length 17 [2021-06-05 14:46:05,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:05,126 INFO L482 AbstractCegarLoop]: Abstraction has 194 states and 562 transitions. [2021-06-05 14:46:05,127 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 14:46:05,127 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 562 transitions. [2021-06-05 14:46:05,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:05,127 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:05,127 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:05,127 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-06-05 14:46:05,127 INFO L430 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:05,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:05,128 INFO L82 PathProgramCache]: Analyzing trace with hash -2074864322, now seen corresponding path program 59 times [2021-06-05 14:46:05,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:05,128 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784670295] [2021-06-05 14:46:05,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:05,166 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 14:46:05,166 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:05,166 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784670295] [2021-06-05 14:46:05,166 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784670295] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:05,166 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:05,166 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:05,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684324210] [2021-06-05 14:46:05,167 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:05,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:05,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:05,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:05,167 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 14:46:05,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:05,294 INFO L93 Difference]: Finished difference Result 430 states and 1172 transitions. [2021-06-05 14:46:05,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:05,294 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 14:46:05,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:05,295 INFO L225 Difference]: With dead ends: 430 [2021-06-05 14:46:05,295 INFO L226 Difference]: Without dead ends: 415 [2021-06-05 14:46:05,295 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 100.6ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:05,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2021-06-05 14:46:05,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 196. [2021-06-05 14:46:05,298 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 14:46:05,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 571 transitions. [2021-06-05 14:46:05,298 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 571 transitions. Word has length 17 [2021-06-05 14:46:05,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:05,298 INFO L482 AbstractCegarLoop]: Abstraction has 196 states and 571 transitions. [2021-06-05 14:46:05,298 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 14:46:05,298 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 571 transitions. [2021-06-05 14:46:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:05,299 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:05,299 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:05,299 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-06-05 14:46:05,299 INFO L430 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:05,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:05,299 INFO L82 PathProgramCache]: Analyzing trace with hash -934580486, now seen corresponding path program 60 times [2021-06-05 14:46:05,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:05,299 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069657828] [2021-06-05 14:46:05,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:05,336 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 14:46:05,336 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:05,336 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069657828] [2021-06-05 14:46:05,336 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069657828] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:05,337 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:05,337 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:05,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578369405] [2021-06-05 14:46:05,337 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:05,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:05,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:05,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:05,338 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 14:46:05,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:05,471 INFO L93 Difference]: Finished difference Result 409 states and 1134 transitions. [2021-06-05 14:46:05,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:05,471 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 14:46:05,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:05,472 INFO L225 Difference]: With dead ends: 409 [2021-06-05 14:46:05,472 INFO L226 Difference]: Without dead ends: 394 [2021-06-05 14:46:05,472 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 89.1ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:05,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-06-05 14:46:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 192. [2021-06-05 14:46:05,475 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 14:46:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 555 transitions. [2021-06-05 14:46:05,475 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 555 transitions. Word has length 17 [2021-06-05 14:46:05,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:05,476 INFO L482 AbstractCegarLoop]: Abstraction has 192 states and 555 transitions. [2021-06-05 14:46:05,476 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 14:46:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 555 transitions. [2021-06-05 14:46:05,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:05,476 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:05,476 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:05,476 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-06-05 14:46:05,476 INFO L430 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:05,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:05,476 INFO L82 PathProgramCache]: Analyzing trace with hash -674451760, now seen corresponding path program 61 times [2021-06-05 14:46:05,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:05,476 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934356487] [2021-06-05 14:46:05,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:05,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 14:46:05,517 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:05,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934356487] [2021-06-05 14:46:05,518 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934356487] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:05,518 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:05,518 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:05,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724572250] [2021-06-05 14:46:05,518 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:05,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:05,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:05,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:05,518 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 14:46:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:05,619 INFO L93 Difference]: Finished difference Result 328 states and 903 transitions. [2021-06-05 14:46:05,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:05,619 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 14:46:05,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:05,620 INFO L225 Difference]: With dead ends: 328 [2021-06-05 14:46:05,620 INFO L226 Difference]: Without dead ends: 313 [2021-06-05 14:46:05,620 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 80.4ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:05,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-06-05 14:46:05,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 197. [2021-06-05 14:46:05,623 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 14:46:05,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 571 transitions. [2021-06-05 14:46:05,623 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 571 transitions. Word has length 17 [2021-06-05 14:46:05,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:05,623 INFO L482 AbstractCegarLoop]: Abstraction has 197 states and 571 transitions. [2021-06-05 14:46:05,623 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 14:46:05,623 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 571 transitions. [2021-06-05 14:46:05,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:05,624 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:05,624 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:05,624 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-06-05 14:46:05,624 INFO L430 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:05,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:05,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1924375180, now seen corresponding path program 62 times [2021-06-05 14:46:05,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:05,624 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297998172] [2021-06-05 14:46:05,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:05,678 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 14:46:05,678 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:05,678 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297998172] [2021-06-05 14:46:05,678 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297998172] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:05,679 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:05,679 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:05,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282253569] [2021-06-05 14:46:05,679 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:05,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:05,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:05,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:05,679 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 14:46:05,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:05,800 INFO L93 Difference]: Finished difference Result 357 states and 963 transitions. [2021-06-05 14:46:05,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:05,800 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 14:46:05,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:05,801 INFO L225 Difference]: With dead ends: 357 [2021-06-05 14:46:05,801 INFO L226 Difference]: Without dead ends: 342 [2021-06-05 14:46:05,801 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 100.6ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:05,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-06-05 14:46:05,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 199. [2021-06-05 14:46:05,804 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 14:46:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 580 transitions. [2021-06-05 14:46:05,804 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 580 transitions. Word has length 17 [2021-06-05 14:46:05,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:05,805 INFO L482 AbstractCegarLoop]: Abstraction has 199 states and 580 transitions. [2021-06-05 14:46:05,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 14:46:05,805 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 580 transitions. [2021-06-05 14:46:05,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:05,805 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:05,805 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:05,805 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-06-05 14:46:05,805 INFO L430 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:05,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:05,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1151956756, now seen corresponding path program 63 times [2021-06-05 14:46:05,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:05,805 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320569341] [2021-06-05 14:46:05,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:05,846 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 14:46:05,847 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:05,847 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320569341] [2021-06-05 14:46:05,847 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320569341] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:05,847 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:05,847 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:05,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758053927] [2021-06-05 14:46:05,847 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:05,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:05,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:05,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:05,847 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 14:46:05,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:05,974 INFO L93 Difference]: Finished difference Result 334 states and 918 transitions. [2021-06-05 14:46:05,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:05,975 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 14:46:05,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:05,975 INFO L225 Difference]: With dead ends: 334 [2021-06-05 14:46:05,975 INFO L226 Difference]: Without dead ends: 319 [2021-06-05 14:46:05,975 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 100.0ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:05,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-06-05 14:46:05,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 195. [2021-06-05 14:46:05,980 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 14:46:05,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 564 transitions. [2021-06-05 14:46:05,980 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 564 transitions. Word has length 17 [2021-06-05 14:46:05,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:05,981 INFO L482 AbstractCegarLoop]: Abstraction has 195 states and 564 transitions. [2021-06-05 14:46:05,981 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 14:46:05,981 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 564 transitions. [2021-06-05 14:46:05,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:05,981 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:05,981 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:05,981 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-06-05 14:46:05,981 INFO L430 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:05,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:05,981 INFO L82 PathProgramCache]: Analyzing trace with hash 263807996, now seen corresponding path program 64 times [2021-06-05 14:46:05,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:05,981 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266334673] [2021-06-05 14:46:05,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:06,016 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 14:46:06,016 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:06,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266334673] [2021-06-05 14:46:06,016 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266334673] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:06,017 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:06,017 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:06,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124815857] [2021-06-05 14:46:06,017 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:06,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:06,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:06,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:06,017 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 14:46:06,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:06,126 INFO L93 Difference]: Finished difference Result 349 states and 945 transitions. [2021-06-05 14:46:06,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:06,126 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 14:46:06,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:06,127 INFO L225 Difference]: With dead ends: 349 [2021-06-05 14:46:06,127 INFO L226 Difference]: Without dead ends: 334 [2021-06-05 14:46:06,127 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 88.7ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:06,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-06-05 14:46:06,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 199. [2021-06-05 14:46:06,130 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 14:46:06,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 580 transitions. [2021-06-05 14:46:06,130 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 580 transitions. Word has length 17 [2021-06-05 14:46:06,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:06,131 INFO L482 AbstractCegarLoop]: Abstraction has 199 states and 580 transitions. [2021-06-05 14:46:06,131 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 14:46:06,131 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 580 transitions. [2021-06-05 14:46:06,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:06,131 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:06,131 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:06,131 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-06-05 14:46:06,131 INFO L430 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:06,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:06,131 INFO L82 PathProgramCache]: Analyzing trace with hash -954827364, now seen corresponding path program 65 times [2021-06-05 14:46:06,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:06,132 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816052939] [2021-06-05 14:46:06,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:06,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 14:46:06,168 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:06,168 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816052939] [2021-06-05 14:46:06,169 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816052939] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:06,169 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:06,169 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:06,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110680136] [2021-06-05 14:46:06,169 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:06,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:06,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:06,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:06,169 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 14:46:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:06,291 INFO L93 Difference]: Finished difference Result 353 states and 951 transitions. [2021-06-05 14:46:06,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:06,291 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 14:46:06,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:06,292 INFO L225 Difference]: With dead ends: 353 [2021-06-05 14:46:06,292 INFO L226 Difference]: Without dead ends: 338 [2021-06-05 14:46:06,292 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 92.8ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:06,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-06-05 14:46:06,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 197. [2021-06-05 14:46:06,295 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 14:46:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 571 transitions. [2021-06-05 14:46:06,295 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 571 transitions. Word has length 17 [2021-06-05 14:46:06,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:06,296 INFO L482 AbstractCegarLoop]: Abstraction has 197 states and 571 transitions. [2021-06-05 14:46:06,296 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 14:46:06,296 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 571 transitions. [2021-06-05 14:46:06,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:06,296 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:06,296 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:06,296 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-06-05 14:46:06,296 INFO L430 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:06,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:06,296 INFO L82 PathProgramCache]: Analyzing trace with hash 120883792, now seen corresponding path program 66 times [2021-06-05 14:46:06,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:06,297 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659566626] [2021-06-05 14:46:06,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:06,340 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 14:46:06,341 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:06,341 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659566626] [2021-06-05 14:46:06,341 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659566626] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:06,341 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:06,341 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:06,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064247875] [2021-06-05 14:46:06,341 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:06,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:06,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:06,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:06,341 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 14:46:06,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:06,448 INFO L93 Difference]: Finished difference Result 324 states and 891 transitions. [2021-06-05 14:46:06,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:06,448 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 14:46:06,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:06,449 INFO L225 Difference]: With dead ends: 324 [2021-06-05 14:46:06,449 INFO L226 Difference]: Without dead ends: 309 [2021-06-05 14:46:06,449 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 82.8ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:06,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-06-05 14:46:06,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 195. [2021-06-05 14:46:06,452 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 14:46:06,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 564 transitions. [2021-06-05 14:46:06,452 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 564 transitions. Word has length 17 [2021-06-05 14:46:06,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:06,452 INFO L482 AbstractCegarLoop]: Abstraction has 195 states and 564 transitions. [2021-06-05 14:46:06,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 14:46:06,452 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 564 transitions. [2021-06-05 14:46:06,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:06,452 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:06,452 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:06,453 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-06-05 14:46:06,453 INFO L430 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:06,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:06,453 INFO L82 PathProgramCache]: Analyzing trace with hash 409284692, now seen corresponding path program 67 times [2021-06-05 14:46:06,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:06,453 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746292749] [2021-06-05 14:46:06,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:06,493 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 14:46:06,493 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:06,493 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746292749] [2021-06-05 14:46:06,493 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746292749] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:06,493 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:06,493 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:06,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684917781] [2021-06-05 14:46:06,493 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:06,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:06,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:06,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:06,494 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 14:46:06,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:06,585 INFO L93 Difference]: Finished difference Result 442 states and 1201 transitions. [2021-06-05 14:46:06,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:06,586 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 14:46:06,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:06,586 INFO L225 Difference]: With dead ends: 442 [2021-06-05 14:46:06,586 INFO L226 Difference]: Without dead ends: 427 [2021-06-05 14:46:06,586 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 73.8ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:06,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-06-05 14:46:06,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 198. [2021-06-05 14:46:06,590 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 14:46:06,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 576 transitions. [2021-06-05 14:46:06,590 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 576 transitions. Word has length 17 [2021-06-05 14:46:06,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:06,590 INFO L482 AbstractCegarLoop]: Abstraction has 198 states and 576 transitions. [2021-06-05 14:46:06,590 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 14:46:06,590 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 576 transitions. [2021-06-05 14:46:06,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:06,590 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:06,590 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:06,591 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-06-05 14:46:06,591 INFO L430 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:06,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:06,591 INFO L82 PathProgramCache]: Analyzing trace with hash -840638728, now seen corresponding path program 68 times [2021-06-05 14:46:06,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:06,591 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456212301] [2021-06-05 14:46:06,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:06,630 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 14:46:06,630 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:06,630 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456212301] [2021-06-05 14:46:06,630 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456212301] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:06,630 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:06,631 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:06,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483172593] [2021-06-05 14:46:06,631 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:06,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:06,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:06,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:06,631 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 14:46:06,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:06,751 INFO L93 Difference]: Finished difference Result 465 states and 1248 transitions. [2021-06-05 14:46:06,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:06,751 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 14:46:06,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:06,752 INFO L225 Difference]: With dead ends: 465 [2021-06-05 14:46:06,752 INFO L226 Difference]: Without dead ends: 450 [2021-06-05 14:46:06,752 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 92.7ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:06,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-06-05 14:46:06,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 200. [2021-06-05 14:46:06,755 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 14:46:06,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 585 transitions. [2021-06-05 14:46:06,756 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 585 transitions. Word has length 17 [2021-06-05 14:46:06,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:06,756 INFO L482 AbstractCegarLoop]: Abstraction has 200 states and 585 transitions. [2021-06-05 14:46:06,756 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 14:46:06,756 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 585 transitions. [2021-06-05 14:46:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:06,756 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:06,756 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:06,757 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-06-05 14:46:06,757 INFO L430 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:06,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:06,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2059274088, now seen corresponding path program 69 times [2021-06-05 14:46:06,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:06,757 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436479714] [2021-06-05 14:46:06,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:06,798 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 14:46:06,798 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:06,798 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436479714] [2021-06-05 14:46:06,798 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436479714] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:06,798 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:06,798 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:06,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64372461] [2021-06-05 14:46:06,799 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:06,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:06,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:06,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:06,799 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 14:46:06,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:06,919 INFO L93 Difference]: Finished difference Result 442 states and 1203 transitions. [2021-06-05 14:46:06,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:06,920 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 14:46:06,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:06,920 INFO L225 Difference]: With dead ends: 442 [2021-06-05 14:46:06,920 INFO L226 Difference]: Without dead ends: 427 [2021-06-05 14:46:06,920 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 96.0ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:06,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-06-05 14:46:06,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 196. [2021-06-05 14:46:06,923 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 14:46:06,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 569 transitions. [2021-06-05 14:46:06,924 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 569 transitions. Word has length 17 [2021-06-05 14:46:06,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:06,924 INFO L482 AbstractCegarLoop]: Abstraction has 196 states and 569 transitions. [2021-06-05 14:46:06,924 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 14:46:06,924 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 569 transitions. [2021-06-05 14:46:06,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:06,924 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:06,924 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:06,925 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-06-05 14:46:06,925 INFO L430 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:06,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:06,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1005390608, now seen corresponding path program 70 times [2021-06-05 14:46:06,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:06,926 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794874049] [2021-06-05 14:46:06,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:06,972 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 14:46:06,973 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:06,973 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794874049] [2021-06-05 14:46:06,973 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794874049] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:06,973 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:06,973 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:06,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479532613] [2021-06-05 14:46:06,973 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:06,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:06,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:06,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:06,973 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 14:46:07,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:07,146 INFO L93 Difference]: Finished difference Result 393 states and 1085 transitions. [2021-06-05 14:46:07,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:07,146 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 14:46:07,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:07,147 INFO L225 Difference]: With dead ends: 393 [2021-06-05 14:46:07,147 INFO L226 Difference]: Without dead ends: 378 [2021-06-05 14:46:07,147 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 132.2ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:07,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-06-05 14:46:07,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 199. [2021-06-05 14:46:07,150 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 14:46:07,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 580 transitions. [2021-06-05 14:46:07,150 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 580 transitions. Word has length 17 [2021-06-05 14:46:07,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:07,150 INFO L482 AbstractCegarLoop]: Abstraction has 199 states and 580 transitions. [2021-06-05 14:46:07,150 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 14:46:07,150 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 580 transitions. [2021-06-05 14:46:07,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:07,151 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:07,151 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:07,151 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-06-05 14:46:07,151 INFO L430 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:07,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:07,151 INFO L82 PathProgramCache]: Analyzing trace with hash 184219092, now seen corresponding path program 71 times [2021-06-05 14:46:07,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:07,151 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084620548] [2021-06-05 14:46:07,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:07,194 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 14:46:07,194 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:07,194 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084620548] [2021-06-05 14:46:07,194 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084620548] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:07,194 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:07,194 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:07,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65892229] [2021-06-05 14:46:07,194 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:07,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:07,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:07,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:07,195 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 14:46:07,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:07,352 INFO L93 Difference]: Finished difference Result 391 states and 1089 transitions. [2021-06-05 14:46:07,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:07,352 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 14:46:07,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:07,353 INFO L225 Difference]: With dead ends: 391 [2021-06-05 14:46:07,353 INFO L226 Difference]: Without dead ends: 376 [2021-06-05 14:46:07,353 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 130.8ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:07,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-06-05 14:46:07,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 202. [2021-06-05 14:46:07,356 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 14:46:07,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 594 transitions. [2021-06-05 14:46:07,357 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 594 transitions. Word has length 17 [2021-06-05 14:46:07,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:07,357 INFO L482 AbstractCegarLoop]: Abstraction has 202 states and 594 transitions. [2021-06-05 14:46:07,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 14:46:07,357 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 594 transitions. [2021-06-05 14:46:07,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:07,357 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:07,357 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:07,357 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-06-05 14:46:07,357 INFO L430 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:07,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:07,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1514501296, now seen corresponding path program 72 times [2021-06-05 14:46:07,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:07,358 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158729194] [2021-06-05 14:46:07,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:07,400 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 14:46:07,400 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:07,400 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158729194] [2021-06-05 14:46:07,400 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158729194] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:07,401 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:07,401 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:07,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047257361] [2021-06-05 14:46:07,401 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:07,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:07,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:07,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:07,401 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 14:46:07,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:07,557 INFO L93 Difference]: Finished difference Result 368 states and 1044 transitions. [2021-06-05 14:46:07,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:07,557 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 14:46:07,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:07,558 INFO L225 Difference]: With dead ends: 368 [2021-06-05 14:46:07,558 INFO L226 Difference]: Without dead ends: 353 [2021-06-05 14:46:07,558 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 132.3ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:07,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-06-05 14:46:07,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 196. [2021-06-05 14:46:07,561 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 14:46:07,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 569 transitions. [2021-06-05 14:46:07,561 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 569 transitions. Word has length 17 [2021-06-05 14:46:07,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:07,561 INFO L482 AbstractCegarLoop]: Abstraction has 196 states and 569 transitions. [2021-06-05 14:46:07,561 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 14:46:07,561 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 569 transitions. [2021-06-05 14:46:07,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:07,561 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:07,561 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:07,562 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-06-05 14:46:07,562 INFO L430 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:07,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:07,562 INFO L82 PathProgramCache]: Analyzing trace with hash 81063412, now seen corresponding path program 73 times [2021-06-05 14:46:07,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:07,562 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235252720] [2021-06-05 14:46:07,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:07,603 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 14:46:07,603 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:07,603 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235252720] [2021-06-05 14:46:07,603 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235252720] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:07,603 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:07,603 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:07,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185340907] [2021-06-05 14:46:07,603 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:07,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:07,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:07,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:07,604 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 14:46:07,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:07,711 INFO L93 Difference]: Finished difference Result 445 states and 1229 transitions. [2021-06-05 14:46:07,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:07,711 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 14:46:07,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:07,712 INFO L225 Difference]: With dead ends: 445 [2021-06-05 14:46:07,712 INFO L226 Difference]: Without dead ends: 430 [2021-06-05 14:46:07,712 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 83.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:07,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2021-06-05 14:46:07,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 199. [2021-06-05 14:46:07,715 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 14:46:07,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 584 transitions. [2021-06-05 14:46:07,716 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 584 transitions. Word has length 17 [2021-06-05 14:46:07,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:07,716 INFO L482 AbstractCegarLoop]: Abstraction has 199 states and 584 transitions. [2021-06-05 14:46:07,716 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 14:46:07,716 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 584 transitions. [2021-06-05 14:46:07,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:07,716 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:07,716 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:07,716 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-06-05 14:46:07,716 INFO L430 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:07,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:07,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1137571948, now seen corresponding path program 74 times [2021-06-05 14:46:07,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:07,717 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875519700] [2021-06-05 14:46:07,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:07,753 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 14:46:07,753 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:07,753 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875519700] [2021-06-05 14:46:07,753 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875519700] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:07,753 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:07,753 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:07,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361126577] [2021-06-05 14:46:07,753 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:07,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:07,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:07,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:07,753 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 14:46:07,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:07,866 INFO L93 Difference]: Finished difference Result 443 states and 1222 transitions. [2021-06-05 14:46:07,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:07,866 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 14:46:07,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:07,867 INFO L225 Difference]: With dead ends: 443 [2021-06-05 14:46:07,867 INFO L226 Difference]: Without dead ends: 428 [2021-06-05 14:46:07,867 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 81.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:07,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-06-05 14:46:07,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 197. [2021-06-05 14:46:07,870 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 14:46:07,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 575 transitions. [2021-06-05 14:46:07,871 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 575 transitions. Word has length 17 [2021-06-05 14:46:07,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:07,871 INFO L482 AbstractCegarLoop]: Abstraction has 197 states and 575 transitions. [2021-06-05 14:46:07,871 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 14:46:07,871 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 575 transitions. [2021-06-05 14:46:07,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:07,871 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:07,871 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:07,871 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-06-05 14:46:07,871 INFO L430 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:07,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:07,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1070123960, now seen corresponding path program 75 times [2021-06-05 14:46:07,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:07,872 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470746479] [2021-06-05 14:46:07,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:07,919 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 14:46:07,919 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:07,919 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470746479] [2021-06-05 14:46:07,919 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470746479] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:07,919 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:07,920 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:07,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390826163] [2021-06-05 14:46:07,920 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:07,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:07,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:07,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:07,920 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 14:46:08,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:08,081 INFO L93 Difference]: Finished difference Result 437 states and 1201 transitions. [2021-06-05 14:46:08,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:08,081 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 14:46:08,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:08,082 INFO L225 Difference]: With dead ends: 437 [2021-06-05 14:46:08,082 INFO L226 Difference]: Without dead ends: 422 [2021-06-05 14:46:08,082 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 119.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:08,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-06-05 14:46:08,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 200. [2021-06-05 14:46:08,085 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 14:46:08,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 589 transitions. [2021-06-05 14:46:08,085 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 589 transitions. Word has length 17 [2021-06-05 14:46:08,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:08,086 INFO L482 AbstractCegarLoop]: Abstraction has 200 states and 589 transitions. [2021-06-05 14:46:08,086 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 14:46:08,086 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 589 transitions. [2021-06-05 14:46:08,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:08,086 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:08,086 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:08,086 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-06-05 14:46:08,086 INFO L430 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:08,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:08,086 INFO L82 PathProgramCache]: Analyzing trace with hash -100065036, now seen corresponding path program 76 times [2021-06-05 14:46:08,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:08,086 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330919071] [2021-06-05 14:46:08,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:08,133 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 14:46:08,133 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:08,133 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330919071] [2021-06-05 14:46:08,134 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330919071] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:08,134 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:08,134 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:08,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446693105] [2021-06-05 14:46:08,134 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:08,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:08,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:08,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:08,134 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 14:46:08,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:08,282 INFO L93 Difference]: Finished difference Result 421 states and 1178 transitions. [2021-06-05 14:46:08,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:08,282 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 14:46:08,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:08,283 INFO L225 Difference]: With dead ends: 421 [2021-06-05 14:46:08,283 INFO L226 Difference]: Without dead ends: 406 [2021-06-05 14:46:08,283 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 120.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:08,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-06-05 14:46:08,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 197. [2021-06-05 14:46:08,286 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 14:46:08,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 575 transitions. [2021-06-05 14:46:08,287 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 575 transitions. Word has length 17 [2021-06-05 14:46:08,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:08,287 INFO L482 AbstractCegarLoop]: Abstraction has 197 states and 575 transitions. [2021-06-05 14:46:08,287 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 14:46:08,287 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 575 transitions. [2021-06-05 14:46:08,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:08,287 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:08,287 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:08,287 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-06-05 14:46:08,287 INFO L430 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:08,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:08,287 INFO L82 PathProgramCache]: Analyzing trace with hash -117002088, now seen corresponding path program 77 times [2021-06-05 14:46:08,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:08,288 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065391796] [2021-06-05 14:46:08,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:08,330 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 14:46:08,330 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:08,330 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065391796] [2021-06-05 14:46:08,330 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065391796] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:08,330 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:08,330 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:08,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637704504] [2021-06-05 14:46:08,330 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:08,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:08,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:08,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:08,331 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 14:46:08,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:08,457 INFO L93 Difference]: Finished difference Result 405 states and 1129 transitions. [2021-06-05 14:46:08,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:08,457 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 14:46:08,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:08,458 INFO L225 Difference]: With dead ends: 405 [2021-06-05 14:46:08,458 INFO L226 Difference]: Without dead ends: 390 [2021-06-05 14:46:08,458 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 91.1ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:08,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-06-05 14:46:08,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 199. [2021-06-05 14:46:08,461 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 14:46:08,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 584 transitions. [2021-06-05 14:46:08,462 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 584 transitions. Word has length 17 [2021-06-05 14:46:08,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:08,462 INFO L482 AbstractCegarLoop]: Abstraction has 199 states and 584 transitions. [2021-06-05 14:46:08,462 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 14:46:08,462 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 584 transitions. [2021-06-05 14:46:08,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:08,462 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:08,462 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:08,462 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-06-05 14:46:08,462 INFO L430 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:08,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:08,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1023281748, now seen corresponding path program 78 times [2021-06-05 14:46:08,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:08,463 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977402725] [2021-06-05 14:46:08,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:08,502 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 14:46:08,503 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:08,503 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977402725] [2021-06-05 14:46:08,503 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977402725] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:08,503 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:08,503 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:08,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239855212] [2021-06-05 14:46:08,503 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:08,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:08,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:08,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:08,503 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 14:46:08,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:08,637 INFO L93 Difference]: Finished difference Result 384 states and 1091 transitions. [2021-06-05 14:46:08,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:08,638 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 14:46:08,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:08,638 INFO L225 Difference]: With dead ends: 384 [2021-06-05 14:46:08,638 INFO L226 Difference]: Without dead ends: 369 [2021-06-05 14:46:08,638 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 93.3ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:08,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-06-05 14:46:08,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 195. [2021-06-05 14:46:08,646 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 14:46:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 564 transitions. [2021-06-05 14:46:08,646 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 564 transitions. Word has length 17 [2021-06-05 14:46:08,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:08,646 INFO L482 AbstractCegarLoop]: Abstraction has 195 states and 564 transitions. [2021-06-05 14:46:08,646 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 14:46:08,646 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 564 transitions. [2021-06-05 14:46:08,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:08,647 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:08,647 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:08,647 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-06-05 14:46:08,647 INFO L430 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:08,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:08,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1228196736, now seen corresponding path program 79 times [2021-06-05 14:46:08,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:08,647 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403892151] [2021-06-05 14:46:08,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:08,681 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 14:46:08,681 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:08,681 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403892151] [2021-06-05 14:46:08,681 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403892151] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:08,681 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:08,681 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:08,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559188208] [2021-06-05 14:46:08,681 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:08,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:08,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:08,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:08,682 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 14:46:08,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:08,813 INFO L93 Difference]: Finished difference Result 425 states and 1163 transitions. [2021-06-05 14:46:08,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:08,813 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 14:46:08,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:08,814 INFO L225 Difference]: With dead ends: 425 [2021-06-05 14:46:08,814 INFO L226 Difference]: Without dead ends: 410 [2021-06-05 14:46:08,814 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 93.3ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:08,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-06-05 14:46:08,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 200. [2021-06-05 14:46:08,817 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 14:46:08,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 585 transitions. [2021-06-05 14:46:08,817 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 585 transitions. Word has length 17 [2021-06-05 14:46:08,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:08,817 INFO L482 AbstractCegarLoop]: Abstraction has 200 states and 585 transitions. [2021-06-05 14:46:08,818 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 14:46:08,818 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 585 transitions. [2021-06-05 14:46:08,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:08,818 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:08,818 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:08,818 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-06-05 14:46:08,818 INFO L430 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:08,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:08,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1848135200, now seen corresponding path program 80 times [2021-06-05 14:46:08,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:08,818 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575928995] [2021-06-05 14:46:08,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:08,867 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 14:46:08,867 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:08,867 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575928995] [2021-06-05 14:46:08,867 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575928995] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:08,867 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:08,867 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:08,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725831932] [2021-06-05 14:46:08,867 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:08,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:08,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:08,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:08,868 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 14:46:08,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:09,000 INFO L93 Difference]: Finished difference Result 429 states and 1169 transitions. [2021-06-05 14:46:09,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:09,000 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 14:46:09,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:09,001 INFO L225 Difference]: With dead ends: 429 [2021-06-05 14:46:09,001 INFO L226 Difference]: Without dead ends: 414 [2021-06-05 14:46:09,001 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 101.6ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:09,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-06-05 14:46:09,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 198. [2021-06-05 14:46:09,004 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 14:46:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 576 transitions. [2021-06-05 14:46:09,004 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 576 transitions. Word has length 17 [2021-06-05 14:46:09,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:09,005 INFO L482 AbstractCegarLoop]: Abstraction has 198 states and 576 transitions. [2021-06-05 14:46:09,005 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 14:46:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 576 transitions. [2021-06-05 14:46:09,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:09,005 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:09,005 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:09,005 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-06-05 14:46:09,005 INFO L430 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:09,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:09,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1371120940, now seen corresponding path program 81 times [2021-06-05 14:46:09,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:09,006 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680034334] [2021-06-05 14:46:09,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:09,048 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 14:46:09,048 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:09,048 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680034334] [2021-06-05 14:46:09,048 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680034334] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:09,048 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:09,048 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:09,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633397499] [2021-06-05 14:46:09,048 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:09,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:09,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:09,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:09,049 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 14:46:09,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:09,150 INFO L93 Difference]: Finished difference Result 429 states and 1163 transitions. [2021-06-05 14:46:09,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:09,151 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 14:46:09,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:09,151 INFO L225 Difference]: With dead ends: 429 [2021-06-05 14:46:09,151 INFO L226 Difference]: Without dead ends: 414 [2021-06-05 14:46:09,152 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 75.6ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:09,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-06-05 14:46:09,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 196. [2021-06-05 14:46:09,154 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 14:46:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 569 transitions. [2021-06-05 14:46:09,155 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 569 transitions. Word has length 17 [2021-06-05 14:46:09,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:09,155 INFO L482 AbstractCegarLoop]: Abstraction has 196 states and 569 transitions. [2021-06-05 14:46:09,155 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 14:46:09,155 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 569 transitions. [2021-06-05 14:46:09,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:09,155 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:09,155 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:09,155 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-06-05 14:46:09,155 INFO L430 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:09,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:09,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1608879492, now seen corresponding path program 82 times [2021-06-05 14:46:09,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:09,156 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145735557] [2021-06-05 14:46:09,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:09,189 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 14:46:09,190 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:09,190 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145735557] [2021-06-05 14:46:09,190 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145735557] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:09,190 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:09,190 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:09,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562284325] [2021-06-05 14:46:09,190 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:09,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:09,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:09,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:09,190 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 14:46:09,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:09,301 INFO L93 Difference]: Finished difference Result 451 states and 1224 transitions. [2021-06-05 14:46:09,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:09,301 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 14:46:09,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:09,302 INFO L225 Difference]: With dead ends: 451 [2021-06-05 14:46:09,302 INFO L226 Difference]: Without dead ends: 436 [2021-06-05 14:46:09,302 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 76.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:09,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2021-06-05 14:46:09,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 199. [2021-06-05 14:46:09,305 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 14:46:09,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 584 transitions. [2021-06-05 14:46:09,306 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 584 transitions. Word has length 17 [2021-06-05 14:46:09,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:09,306 INFO L482 AbstractCegarLoop]: Abstraction has 199 states and 584 transitions. [2021-06-05 14:46:09,306 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 14:46:09,306 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 584 transitions. [2021-06-05 14:46:09,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:09,306 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:09,306 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:09,306 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-06-05 14:46:09,306 INFO L430 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:09,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:09,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1467452444, now seen corresponding path program 83 times [2021-06-05 14:46:09,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:09,307 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360769688] [2021-06-05 14:46:09,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:09,344 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 14:46:09,345 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:09,345 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360769688] [2021-06-05 14:46:09,345 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360769688] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:09,345 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:09,345 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:09,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642572074] [2021-06-05 14:46:09,345 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:09,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:09,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:09,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:09,345 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 14:46:09,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:09,477 INFO L93 Difference]: Finished difference Result 455 states and 1230 transitions. [2021-06-05 14:46:09,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:09,477 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 14:46:09,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:09,479 INFO L225 Difference]: With dead ends: 455 [2021-06-05 14:46:09,479 INFO L226 Difference]: Without dead ends: 440 [2021-06-05 14:46:09,479 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 84.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:09,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-06-05 14:46:09,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 197. [2021-06-05 14:46:09,482 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 14:46:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 575 transitions. [2021-06-05 14:46:09,482 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 575 transitions. Word has length 17 [2021-06-05 14:46:09,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:09,482 INFO L482 AbstractCegarLoop]: Abstraction has 197 states and 575 transitions. [2021-06-05 14:46:09,482 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 14:46:09,482 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 575 transitions. [2021-06-05 14:46:09,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:09,482 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:09,482 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:09,483 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-06-05 14:46:09,483 INFO L430 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:09,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:09,483 INFO L82 PathProgramCache]: Analyzing trace with hash -619818944, now seen corresponding path program 84 times [2021-06-05 14:46:09,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:09,483 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960435008] [2021-06-05 14:46:09,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:09,521 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 14:46:09,521 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:09,521 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960435008] [2021-06-05 14:46:09,521 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960435008] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:09,521 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:09,522 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:09,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963020810] [2021-06-05 14:46:09,522 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:09,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:09,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:09,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:09,522 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 14:46:09,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:09,666 INFO L93 Difference]: Finished difference Result 422 states and 1158 transitions. [2021-06-05 14:46:09,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:09,667 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 14:46:09,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:09,667 INFO L225 Difference]: With dead ends: 422 [2021-06-05 14:46:09,667 INFO L226 Difference]: Without dead ends: 407 [2021-06-05 14:46:09,668 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 108.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:09,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-06-05 14:46:09,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 200. [2021-06-05 14:46:09,670 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 14:46:09,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 589 transitions. [2021-06-05 14:46:09,671 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 589 transitions. Word has length 17 [2021-06-05 14:46:09,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:09,671 INFO L482 AbstractCegarLoop]: Abstraction has 200 states and 589 transitions. [2021-06-05 14:46:09,671 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 14:46:09,671 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 589 transitions. [2021-06-05 14:46:09,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:09,671 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:09,671 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:09,671 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-06-05 14:46:09,671 INFO L430 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:09,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:09,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1790007940, now seen corresponding path program 85 times [2021-06-05 14:46:09,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:09,672 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487679165] [2021-06-05 14:46:09,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:09,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 14:46:09,712 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:09,712 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487679165] [2021-06-05 14:46:09,712 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487679165] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:09,713 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:09,713 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:09,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162902381] [2021-06-05 14:46:09,713 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:09,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:09,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:09,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:09,713 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 14:46:09,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:09,861 INFO L93 Difference]: Finished difference Result 406 states and 1135 transitions. [2021-06-05 14:46:09,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:09,861 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 14:46:09,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:09,862 INFO L225 Difference]: With dead ends: 406 [2021-06-05 14:46:09,862 INFO L226 Difference]: Without dead ends: 391 [2021-06-05 14:46:09,862 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 111.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:09,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-06-05 14:46:09,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 197. [2021-06-05 14:46:09,864 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 14:46:09,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 575 transitions. [2021-06-05 14:46:09,865 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 575 transitions. Word has length 17 [2021-06-05 14:46:09,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:09,865 INFO L482 AbstractCegarLoop]: Abstraction has 197 states and 575 transitions. [2021-06-05 14:46:09,865 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 14:46:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 575 transitions. [2021-06-05 14:46:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:09,865 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:09,865 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:09,865 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-06-05 14:46:09,865 INFO L430 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:09,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:09,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1806944992, now seen corresponding path program 86 times [2021-06-05 14:46:09,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:09,866 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503340328] [2021-06-05 14:46:09,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:09,913 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 14:46:09,913 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:09,913 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503340328] [2021-06-05 14:46:09,913 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503340328] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:09,913 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:09,913 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:09,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483025080] [2021-06-05 14:46:09,913 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:09,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:09,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:09,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:09,914 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 14:46:10,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:10,025 INFO L93 Difference]: Finished difference Result 440 states and 1205 transitions. [2021-06-05 14:46:10,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:10,026 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 14:46:10,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:10,026 INFO L225 Difference]: With dead ends: 440 [2021-06-05 14:46:10,026 INFO L226 Difference]: Without dead ends: 425 [2021-06-05 14:46:10,026 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 86.7ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:10,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-06-05 14:46:10,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 199. [2021-06-05 14:46:10,029 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 14:46:10,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 584 transitions. [2021-06-05 14:46:10,030 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 584 transitions. Word has length 17 [2021-06-05 14:46:10,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:10,030 INFO L482 AbstractCegarLoop]: Abstraction has 199 states and 584 transitions. [2021-06-05 14:46:10,030 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 14:46:10,030 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 584 transitions. [2021-06-05 14:46:10,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:10,030 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:10,030 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:10,030 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-06-05 14:46:10,030 INFO L430 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:10,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:10,030 INFO L82 PathProgramCache]: Analyzing trace with hash -666661156, now seen corresponding path program 87 times [2021-06-05 14:46:10,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:10,030 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295810140] [2021-06-05 14:46:10,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:10,068 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 14:46:10,068 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:10,068 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295810140] [2021-06-05 14:46:10,068 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295810140] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:10,068 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:10,068 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:10,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138409864] [2021-06-05 14:46:10,068 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:10,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:10,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:10,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:10,069 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 14:46:10,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:10,187 INFO L93 Difference]: Finished difference Result 419 states and 1167 transitions. [2021-06-05 14:46:10,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:10,187 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 14:46:10,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:10,188 INFO L225 Difference]: With dead ends: 419 [2021-06-05 14:46:10,188 INFO L226 Difference]: Without dead ends: 404 [2021-06-05 14:46:10,188 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 77.8ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:10,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-06-05 14:46:10,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 196. [2021-06-05 14:46:10,190 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 14:46:10,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 569 transitions. [2021-06-05 14:46:10,191 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 569 transitions. Word has length 17 [2021-06-05 14:46:10,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:10,191 INFO L482 AbstractCegarLoop]: Abstraction has 196 states and 569 transitions. [2021-06-05 14:46:10,191 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 14:46:10,191 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 569 transitions. [2021-06-05 14:46:10,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:10,191 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:10,191 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:10,191 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-06-05 14:46:10,191 INFO L430 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:10,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:10,192 INFO L82 PathProgramCache]: Analyzing trace with hash 201773648, now seen corresponding path program 88 times [2021-06-05 14:46:10,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:10,192 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521126128] [2021-06-05 14:46:10,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:10,238 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 14:46:10,238 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:10,238 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521126128] [2021-06-05 14:46:10,238 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521126128] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:10,238 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:10,238 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:10,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811167909] [2021-06-05 14:46:10,239 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:10,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:10,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:10,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:10,239 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 14:46:10,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:10,336 INFO L93 Difference]: Finished difference Result 382 states and 1052 transitions. [2021-06-05 14:46:10,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:10,336 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 14:46:10,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:10,337 INFO L225 Difference]: With dead ends: 382 [2021-06-05 14:46:10,337 INFO L226 Difference]: Without dead ends: 367 [2021-06-05 14:46:10,337 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 78.2ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:10,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-06-05 14:46:10,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 198. [2021-06-05 14:46:10,340 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 14:46:10,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 576 transitions. [2021-06-05 14:46:10,340 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 576 transitions. Word has length 17 [2021-06-05 14:46:10,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:10,340 INFO L482 AbstractCegarLoop]: Abstraction has 198 states and 576 transitions. [2021-06-05 14:46:10,340 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 14:46:10,340 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 576 transitions. [2021-06-05 14:46:10,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:10,340 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:10,340 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:10,340 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-06-05 14:46:10,341 INFO L430 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:10,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:10,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1159324884, now seen corresponding path program 89 times [2021-06-05 14:46:10,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:10,341 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237218525] [2021-06-05 14:46:10,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:10,378 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 14:46:10,379 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:10,379 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237218525] [2021-06-05 14:46:10,379 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237218525] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:10,379 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:10,379 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:10,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693235473] [2021-06-05 14:46:10,379 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:10,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:10,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:10,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:10,379 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 14:46:10,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:10,503 INFO L93 Difference]: Finished difference Result 383 states and 1063 transitions. [2021-06-05 14:46:10,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:10,504 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 14:46:10,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:10,504 INFO L225 Difference]: With dead ends: 383 [2021-06-05 14:46:10,504 INFO L226 Difference]: Without dead ends: 368 [2021-06-05 14:46:10,504 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 94.9ms TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:10,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-06-05 14:46:10,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 200. [2021-06-05 14:46:10,507 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 14:46:10,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 585 transitions. [2021-06-05 14:46:10,507 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 585 transitions. Word has length 17 [2021-06-05 14:46:10,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:10,507 INFO L482 AbstractCegarLoop]: Abstraction has 200 states and 585 transitions. [2021-06-05 14:46:10,507 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 14:46:10,507 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 585 transitions. [2021-06-05 14:46:10,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:46:10,508 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:10,508 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:10,508 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-06-05 14:46:10,508 INFO L430 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:10,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:10,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1995358576, now seen corresponding path program 90 times [2021-06-05 14:46:10,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:10,509 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111955292] [2021-06-05 14:46:10,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:10,549 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 14:46:10,550 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:10,550 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111955292] [2021-06-05 14:46:10,550 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111955292] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:10,550 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:10,550 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:10,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287388053] [2021-06-05 14:46:10,550 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:10,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:10,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:10,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:10,551 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 14:46:10,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:10,678 INFO L93 Difference]: Finished difference Result 362 states and 1025 transitions. [2021-06-05 14:46:10,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:10,679 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 14:46:10,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:10,679 INFO L225 Difference]: With dead ends: 362 [2021-06-05 14:46:10,679 INFO L226 Difference]: Without dead ends: 347 [2021-06-05 14:46:10,679 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 95.1ms TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:10,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-06-05 14:46:10,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 195. [2021-06-05 14:46:10,684 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 14:46:10,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 564 transitions. [2021-06-05 14:46:10,684 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 564 transitions. Word has length 17 [2021-06-05 14:46:10,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:10,684 INFO L482 AbstractCegarLoop]: Abstraction has 195 states and 564 transitions. [2021-06-05 14:46:10,684 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 14:46:10,685 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 564 transitions. [2021-06-05 14:46:10,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:10,685 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:10,685 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:10,685 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-06-05 14:46:10,685 INFO L430 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:10,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:10,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1303103675, now seen corresponding path program 1 times [2021-06-05 14:46:10,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:10,685 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331756732] [2021-06-05 14:46:10,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:10,738 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 14:46:10,738 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:10,738 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331756732] [2021-06-05 14:46:10,738 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331756732] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:10,738 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411836284] [2021-06-05 14:46:10,739 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 14:46:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:10,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:10,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:10,956 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 14:46:10,956 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411836284] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:10,956 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:10,956 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:46:10,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966177651] [2021-06-05 14:46:10,956 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:46:10,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:10,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:46:10,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:10,957 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 14:46:11,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:11,125 INFO L93 Difference]: Finished difference Result 363 states and 1031 transitions. [2021-06-05 14:46:11,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:11,125 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 14:46:11,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:11,132 INFO L225 Difference]: With dead ends: 363 [2021-06-05 14:46:11,132 INFO L226 Difference]: Without dead ends: 344 [2021-06-05 14:46:11,132 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 136.1ms TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:11,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-06-05 14:46:11,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 208. [2021-06-05 14:46:11,136 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 14:46:11,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 613 transitions. [2021-06-05 14:46:11,137 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 613 transitions. Word has length 18 [2021-06-05 14:46:11,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:11,137 INFO L482 AbstractCegarLoop]: Abstraction has 208 states and 613 transitions. [2021-06-05 14:46:11,137 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 14:46:11,137 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 613 transitions. [2021-06-05 14:46:11,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:11,137 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:11,137 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:11,356 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable105 [2021-06-05 14:46:11,357 INFO L430 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:11,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:11,357 INFO L82 PathProgramCache]: Analyzing trace with hash -95550603, now seen corresponding path program 2 times [2021-06-05 14:46:11,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:11,357 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151248278] [2021-06-05 14:46:11,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:11,419 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 14:46:11,419 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:11,419 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151248278] [2021-06-05 14:46:11,419 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151248278] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:11,419 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285805294] [2021-06-05 14:46:11,419 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 14:46:11,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:11,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:11,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:11,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:11,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 14:46:11,518 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285805294] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:11,518 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:11,518 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 14:46:11,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654502437] [2021-06-05 14:46:11,518 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:46:11,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:11,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:46:11,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:46:11,518 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 14:46:11,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:11,658 INFO L93 Difference]: Finished difference Result 405 states and 1139 transitions. [2021-06-05 14:46:11,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:11,658 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 14:46:11,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:11,659 INFO L225 Difference]: With dead ends: 405 [2021-06-05 14:46:11,659 INFO L226 Difference]: Without dead ends: 386 [2021-06-05 14:46:11,659 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 125.5ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:46:11,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2021-06-05 14:46:11,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 214. [2021-06-05 14:46:11,664 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 14:46:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 640 transitions. [2021-06-05 14:46:11,664 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 640 transitions. Word has length 18 [2021-06-05 14:46:11,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:11,664 INFO L482 AbstractCegarLoop]: Abstraction has 214 states and 640 transitions. [2021-06-05 14:46:11,664 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 14:46:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 640 transitions. [2021-06-05 14:46:11,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:11,665 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:11,665 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:11,881 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:11,882 INFO L430 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:11,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:11,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1794270991, now seen corresponding path program 3 times [2021-06-05 14:46:11,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:11,882 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790749156] [2021-06-05 14:46:11,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:11,926 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 14:46:11,926 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:11,926 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790749156] [2021-06-05 14:46:11,926 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790749156] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:11,926 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458747481] [2021-06-05 14:46:11,927 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 14:46:11,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:46:11,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:11,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:11,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:12,032 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 14:46:12,032 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458747481] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:12,032 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:12,032 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:46:12,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770027722] [2021-06-05 14:46:12,032 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:46:12,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:12,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:46:12,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:12,033 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 14:46:12,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:12,183 INFO L93 Difference]: Finished difference Result 384 states and 1093 transitions. [2021-06-05 14:46:12,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:12,184 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 14:46:12,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:12,184 INFO L225 Difference]: With dead ends: 384 [2021-06-05 14:46:12,184 INFO L226 Difference]: Without dead ends: 365 [2021-06-05 14:46:12,184 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 120.4ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:12,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-06-05 14:46:12,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 206. [2021-06-05 14:46:12,191 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 14:46:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 608 transitions. [2021-06-05 14:46:12,191 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 608 transitions. Word has length 18 [2021-06-05 14:46:12,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:12,191 INFO L482 AbstractCegarLoop]: Abstraction has 206 states and 608 transitions. [2021-06-05 14:46:12,191 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 14:46:12,191 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 608 transitions. [2021-06-05 14:46:12,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:12,192 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:12,192 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:12,400 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2021-06-05 14:46:12,401 INFO L430 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:12,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:12,401 INFO L82 PathProgramCache]: Analyzing trace with hash -605004921, now seen corresponding path program 4 times [2021-06-05 14:46:12,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:12,401 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229874948] [2021-06-05 14:46:12,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:12,456 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 14:46:12,456 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:12,456 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229874948] [2021-06-05 14:46:12,456 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229874948] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:12,456 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966989019] [2021-06-05 14:46:12,457 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 14:46:12,520 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:46:12,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:12,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:12,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:12,590 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 14:46:12,591 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966989019] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:12,591 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:12,591 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:46:12,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816545238] [2021-06-05 14:46:12,591 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:46:12,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:12,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:46:12,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:12,591 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 14:46:12,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:12,733 INFO L93 Difference]: Finished difference Result 395 states and 1126 transitions. [2021-06-05 14:46:12,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:12,734 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 14:46:12,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:12,734 INFO L225 Difference]: With dead ends: 395 [2021-06-05 14:46:12,734 INFO L226 Difference]: Without dead ends: 376 [2021-06-05 14:46:12,734 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 134.2ms TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:12,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-06-05 14:46:12,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 212. [2021-06-05 14:46:12,737 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 14:46:12,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 631 transitions. [2021-06-05 14:46:12,738 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 631 transitions. Word has length 18 [2021-06-05 14:46:12,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:12,738 INFO L482 AbstractCegarLoop]: Abstraction has 212 states and 631 transitions. [2021-06-05 14:46:12,738 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 14:46:12,738 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 631 transitions. [2021-06-05 14:46:12,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:12,740 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:12,740 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:12,955 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2021-06-05 14:46:12,957 INFO L430 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:12,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:12,958 INFO L82 PathProgramCache]: Analyzing trace with hash -630780405, now seen corresponding path program 5 times [2021-06-05 14:46:12,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:12,958 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112552106] [2021-06-05 14:46:12,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:12,993 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 14:46:12,993 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:12,993 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112552106] [2021-06-05 14:46:12,993 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112552106] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:12,993 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915131142] [2021-06-05 14:46:12,993 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 14:46:13,031 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:13,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:13,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:13,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:13,094 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 14:46:13,094 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915131142] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:13,094 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:13,094 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:46:13,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635786187] [2021-06-05 14:46:13,095 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:46:13,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:13,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:46:13,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:13,095 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 14:46:13,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:13,240 INFO L93 Difference]: Finished difference Result 437 states and 1235 transitions. [2021-06-05 14:46:13,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:13,241 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 14:46:13,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:13,241 INFO L225 Difference]: With dead ends: 437 [2021-06-05 14:46:13,241 INFO L226 Difference]: Without dead ends: 418 [2021-06-05 14:46:13,242 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 112.4ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:13,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-06-05 14:46:13,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 216. [2021-06-05 14:46:13,245 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 14:46:13,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 651 transitions. [2021-06-05 14:46:13,245 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 651 transitions. Word has length 18 [2021-06-05 14:46:13,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:13,245 INFO L482 AbstractCegarLoop]: Abstraction has 216 states and 651 transitions. [2021-06-05 14:46:13,245 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 14:46:13,245 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 651 transitions. [2021-06-05 14:46:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:13,245 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:13,246 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:13,464 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable117 [2021-06-05 14:46:13,464 INFO L430 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:13,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:13,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1965466503, now seen corresponding path program 6 times [2021-06-05 14:46:13,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:13,465 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823844601] [2021-06-05 14:46:13,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:13,502 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 14:46:13,503 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:13,503 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823844601] [2021-06-05 14:46:13,503 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823844601] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:13,503 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368665912] [2021-06-05 14:46:13,503 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 14:46:13,532 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:46:13,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:13,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:13,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:13,590 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 14:46:13,590 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368665912] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:13,590 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:13,590 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 14:46:13,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392089498] [2021-06-05 14:46:13,591 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:46:13,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:13,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:46:13,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:46:13,591 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 14:46:13,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:13,734 INFO L93 Difference]: Finished difference Result 408 states and 1169 transitions. [2021-06-05 14:46:13,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:13,734 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 14:46:13,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:13,735 INFO L225 Difference]: With dead ends: 408 [2021-06-05 14:46:13,735 INFO L226 Difference]: Without dead ends: 389 [2021-06-05 14:46:13,735 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 111.4ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:46:13,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-06-05 14:46:13,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 202. [2021-06-05 14:46:13,737 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 14:46:13,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 604 transitions. [2021-06-05 14:46:13,738 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 604 transitions. Word has length 18 [2021-06-05 14:46:13,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:13,738 INFO L482 AbstractCegarLoop]: Abstraction has 202 states and 604 transitions. [2021-06-05 14:46:13,738 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 14:46:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 604 transitions. [2021-06-05 14:46:13,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:13,738 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:13,738 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:13,948 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:13,949 INFO L430 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:13,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:13,949 INFO L82 PathProgramCache]: Analyzing trace with hash -725187835, now seen corresponding path program 1 times [2021-06-05 14:46:13,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:13,949 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604469655] [2021-06-05 14:46:13,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:14,002 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 14:46:14,002 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:14,002 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604469655] [2021-06-05 14:46:14,002 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604469655] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:14,002 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:14,002 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:46:14,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527280409] [2021-06-05 14:46:14,002 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:46:14,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:14,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:46:14,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:46:14,003 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 14:46:14,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:14,075 INFO L93 Difference]: Finished difference Result 424 states and 1195 transitions. [2021-06-05 14:46:14,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:46:14,076 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 14:46:14,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:14,076 INFO L225 Difference]: With dead ends: 424 [2021-06-05 14:46:14,076 INFO L226 Difference]: Without dead ends: 366 [2021-06-05 14:46:14,076 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 70.6ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:46:14,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-06-05 14:46:14,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 252. [2021-06-05 14:46:14,079 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 14:46:14,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 736 transitions. [2021-06-05 14:46:14,080 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 736 transitions. Word has length 18 [2021-06-05 14:46:14,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:14,080 INFO L482 AbstractCegarLoop]: Abstraction has 252 states and 736 transitions. [2021-06-05 14:46:14,080 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 14:46:14,080 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 736 transitions. [2021-06-05 14:46:14,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:14,080 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:14,081 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:14,081 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2021-06-05 14:46:14,081 INFO L430 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:14,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:14,081 INFO L82 PathProgramCache]: Analyzing trace with hash -809235458, now seen corresponding path program 1 times [2021-06-05 14:46:14,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:14,081 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333683248] [2021-06-05 14:46:14,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:14,133 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 14:46:14,134 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:14,134 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333683248] [2021-06-05 14:46:14,134 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333683248] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:14,134 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:14,134 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:46:14,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260513286] [2021-06-05 14:46:14,134 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:46:14,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:14,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:46:14,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:46:14,134 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 14:46:14,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:14,212 INFO L93 Difference]: Finished difference Result 445 states and 1245 transitions. [2021-06-05 14:46:14,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:46:14,212 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 14:46:14,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:14,213 INFO L225 Difference]: With dead ends: 445 [2021-06-05 14:46:14,213 INFO L226 Difference]: Without dead ends: 358 [2021-06-05 14:46:14,213 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 66.3ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:46:14,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-06-05 14:46:14,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 269. [2021-06-05 14:46:14,220 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 14:46:14,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 783 transitions. [2021-06-05 14:46:14,221 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 783 transitions. Word has length 18 [2021-06-05 14:46:14,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:14,221 INFO L482 AbstractCegarLoop]: Abstraction has 269 states and 783 transitions. [2021-06-05 14:46:14,221 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 14:46:14,221 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 783 transitions. [2021-06-05 14:46:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:14,221 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:14,221 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:14,222 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2021-06-05 14:46:14,222 INFO L430 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:14,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:14,222 INFO L82 PathProgramCache]: Analyzing trace with hash -966424801, now seen corresponding path program 7 times [2021-06-05 14:46:14,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:14,222 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504707598] [2021-06-05 14:46:14,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:14,268 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 14:46:14,268 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:14,268 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504707598] [2021-06-05 14:46:14,268 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504707598] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:14,268 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608475629] [2021-06-05 14:46:14,268 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 14:46:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:14,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:14,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:14,384 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 14:46:14,384 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608475629] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:14,384 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:14,384 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:14,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081764688] [2021-06-05 14:46:14,384 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:14,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:14,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:14,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:14,385 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 14:46:14,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:14,522 INFO L93 Difference]: Finished difference Result 563 states and 1578 transitions. [2021-06-05 14:46:14,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:14,522 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 14:46:14,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:14,523 INFO L225 Difference]: With dead ends: 563 [2021-06-05 14:46:14,523 INFO L226 Difference]: Without dead ends: 544 [2021-06-05 14:46:14,523 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 122.2ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:14,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2021-06-05 14:46:14,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 278. [2021-06-05 14:46:14,527 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 14:46:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 821 transitions. [2021-06-05 14:46:14,527 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 821 transitions. Word has length 18 [2021-06-05 14:46:14,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:14,528 INFO L482 AbstractCegarLoop]: Abstraction has 278 states and 821 transitions. [2021-06-05 14:46:14,528 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 14:46:14,528 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 821 transitions. [2021-06-05 14:46:14,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:14,528 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:14,528 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:14,734 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2021-06-05 14:46:14,735 INFO L430 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:14,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:14,735 INFO L82 PathProgramCache]: Analyzing trace with hash 241128271, now seen corresponding path program 8 times [2021-06-05 14:46:14,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:14,735 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625414311] [2021-06-05 14:46:14,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:14,776 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 14:46:14,776 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:14,776 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625414311] [2021-06-05 14:46:14,776 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625414311] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:14,777 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728026712] [2021-06-05 14:46:14,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 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 14:46:14,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:14,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:14,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:14,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:14,852 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 14:46:14,852 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728026712] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:14,852 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:14,853 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 14:46:14,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431573918] [2021-06-05 14:46:14,853 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:46:14,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:14,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:46:14,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:46:14,853 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 14:46:14,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:14,976 INFO L93 Difference]: Finished difference Result 539 states and 1539 transitions. [2021-06-05 14:46:14,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:14,977 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 14:46:14,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:14,978 INFO L225 Difference]: With dead ends: 539 [2021-06-05 14:46:14,978 INFO L226 Difference]: Without dead ends: 520 [2021-06-05 14:46:14,978 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 96.3ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:14,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-06-05 14:46:14,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 282. [2021-06-05 14:46:14,982 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 14:46:14,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 841 transitions. [2021-06-05 14:46:14,982 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 841 transitions. Word has length 18 [2021-06-05 14:46:14,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:14,982 INFO L482 AbstractCegarLoop]: Abstraction has 282 states and 841 transitions. [2021-06-05 14:46:14,982 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 14:46:14,982 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 841 transitions. [2021-06-05 14:46:14,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:14,983 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:14,983 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:15,199 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128 [2021-06-05 14:46:15,199 INFO L430 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:15,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:15,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1457592117, now seen corresponding path program 9 times [2021-06-05 14:46:15,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:15,200 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398547201] [2021-06-05 14:46:15,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:15,245 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 14:46:15,245 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:15,245 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398547201] [2021-06-05 14:46:15,245 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398547201] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:15,245 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395202125] [2021-06-05 14:46:15,245 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) [2021-06-05 14:46:15,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:46:15,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:15,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:15,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:15,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 14:46:15,345 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395202125] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:15,345 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:15,345 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:15,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057621947] [2021-06-05 14:46:15,346 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:15,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:15,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:15,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:15,346 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 14:46:15,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:15,469 INFO L93 Difference]: Finished difference Result 549 states and 1564 transitions. [2021-06-05 14:46:15,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:15,469 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 14:46:15,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:15,470 INFO L225 Difference]: With dead ends: 549 [2021-06-05 14:46:15,470 INFO L226 Difference]: Without dead ends: 530 [2021-06-05 14:46:15,470 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 133.0ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:15,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-06-05 14:46:15,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 271. [2021-06-05 14:46:15,474 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 14:46:15,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 793 transitions. [2021-06-05 14:46:15,474 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 793 transitions. Word has length 18 [2021-06-05 14:46:15,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:15,474 INFO L482 AbstractCegarLoop]: Abstraction has 271 states and 793 transitions. [2021-06-05 14:46:15,474 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 14:46:15,474 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 793 transitions. [2021-06-05 14:46:15,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:15,475 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:15,475 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:15,688 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:15,689 INFO L430 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:15,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:15,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1254344866, now seen corresponding path program 2 times [2021-06-05 14:46:15,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:15,689 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637110337] [2021-06-05 14:46:15,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:15,731 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 14:46:15,731 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:15,731 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637110337] [2021-06-05 14:46:15,732 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637110337] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:15,732 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:15,732 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:46:15,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565846932] [2021-06-05 14:46:15,732 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:46:15,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:15,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:46:15,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:46:15,732 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 14:46:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:15,814 INFO L93 Difference]: Finished difference Result 528 states and 1474 transitions. [2021-06-05 14:46:15,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:46:15,814 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 14:46:15,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:15,815 INFO L225 Difference]: With dead ends: 528 [2021-06-05 14:46:15,816 INFO L226 Difference]: Without dead ends: 457 [2021-06-05 14:46:15,816 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 59.7ms TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:46:15,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-06-05 14:46:15,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 287. [2021-06-05 14:46:15,819 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 14:46:15,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 850 transitions. [2021-06-05 14:46:15,820 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 850 transitions. Word has length 18 [2021-06-05 14:46:15,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:15,820 INFO L482 AbstractCegarLoop]: Abstraction has 287 states and 850 transitions. [2021-06-05 14:46:15,820 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 14:46:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 850 transitions. [2021-06-05 14:46:15,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:15,820 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:15,820 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:15,821 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2021-06-05 14:46:15,821 INFO L430 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:15,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:15,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1663824377, now seen corresponding path program 10 times [2021-06-05 14:46:15,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:15,821 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11531881] [2021-06-05 14:46:15,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:15,875 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 14:46:15,875 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:15,875 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11531881] [2021-06-05 14:46:15,875 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11531881] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:15,875 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73781862] [2021-06-05 14:46:15,875 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 14:46:15,905 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:46:15,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:15,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:15,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:15,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 14:46:15,977 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73781862] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:15,978 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:15,978 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 14:46:15,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797183894] [2021-06-05 14:46:15,978 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:46:15,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:15,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:46:15,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:15,979 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 14:46:16,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:16,166 INFO L93 Difference]: Finished difference Result 473 states and 1329 transitions. [2021-06-05 14:46:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:16,166 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 14:46:16,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:16,167 INFO L225 Difference]: With dead ends: 473 [2021-06-05 14:46:16,167 INFO L226 Difference]: Without dead ends: 454 [2021-06-05 14:46:16,168 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 184.6ms TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:46:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-06-05 14:46:16,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 291. [2021-06-05 14:46:16,171 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 14:46:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 860 transitions. [2021-06-05 14:46:16,171 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 860 transitions. Word has length 18 [2021-06-05 14:46:16,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:16,172 INFO L482 AbstractCegarLoop]: Abstraction has 291 states and 860 transitions. [2021-06-05 14:46:16,172 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 14:46:16,172 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 860 transitions. [2021-06-05 14:46:16,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:16,172 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:16,172 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:16,385 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2021-06-05 14:46:16,387 INFO L430 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:16,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:16,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1866597709, now seen corresponding path program 11 times [2021-06-05 14:46:16,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:16,387 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511968347] [2021-06-05 14:46:16,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:16,427 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 14:46:16,427 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:16,427 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511968347] [2021-06-05 14:46:16,428 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511968347] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:16,428 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399743922] [2021-06-05 14:46:16,428 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 14:46:16,472 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:16,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:16,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:16,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:16,571 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 14:46:16,571 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399743922] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:16,571 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:16,571 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:16,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566769610] [2021-06-05 14:46:16,571 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:16,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:16,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:16,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:16,571 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 14:46:16,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:16,767 INFO L93 Difference]: Finished difference Result 431 states and 1219 transitions. [2021-06-05 14:46:16,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:16,768 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 14:46:16,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:16,769 INFO L225 Difference]: With dead ends: 431 [2021-06-05 14:46:16,769 INFO L226 Difference]: Without dead ends: 408 [2021-06-05 14:46:16,769 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 209.4ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:16,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-06-05 14:46:16,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 299. [2021-06-05 14:46:16,772 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 14:46:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 884 transitions. [2021-06-05 14:46:16,773 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 884 transitions. Word has length 18 [2021-06-05 14:46:16,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:16,773 INFO L482 AbstractCegarLoop]: Abstraction has 299 states and 884 transitions. [2021-06-05 14:46:16,773 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 14:46:16,773 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 884 transitions. [2021-06-05 14:46:16,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:16,773 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:16,773 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:16,988 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable138 [2021-06-05 14:46:16,989 INFO L430 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:16,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:16,989 INFO L82 PathProgramCache]: Analyzing trace with hash -752125083, now seen corresponding path program 2 times [2021-06-05 14:46:16,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:16,989 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99201923] [2021-06-05 14:46:16,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:17,033 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 14:46:17,034 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:17,034 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99201923] [2021-06-05 14:46:17,034 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99201923] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:17,034 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149098934] [2021-06-05 14:46:17,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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-06-05 14:46:17,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:17,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:17,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:17,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:17,135 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 14:46:17,135 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149098934] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:17,135 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:17,135 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:17,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262025907] [2021-06-05 14:46:17,136 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:17,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:17,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:17,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:17,136 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 14:46:17,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:17,255 INFO L93 Difference]: Finished difference Result 471 states and 1313 transitions. [2021-06-05 14:46:17,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:17,255 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 14:46:17,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:17,256 INFO L225 Difference]: With dead ends: 471 [2021-06-05 14:46:17,256 INFO L226 Difference]: Without dead ends: 449 [2021-06-05 14:46:17,256 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 116.5ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-06-05 14:46:17,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 301. [2021-06-05 14:46:17,260 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 14:46:17,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 891 transitions. [2021-06-05 14:46:17,260 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 891 transitions. Word has length 18 [2021-06-05 14:46:17,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:17,260 INFO L482 AbstractCegarLoop]: Abstraction has 301 states and 891 transitions. [2021-06-05 14:46:17,260 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 14:46:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 891 transitions. [2021-06-05 14:46:17,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:17,261 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:17,262 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:17,462 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:17,462 INFO L430 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:17,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:17,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1213009967, now seen corresponding path program 12 times [2021-06-05 14:46:17,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:17,463 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850985189] [2021-06-05 14:46:17,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:17,510 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 14:46:17,511 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:17,511 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850985189] [2021-06-05 14:46:17,511 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850985189] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:17,511 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145147266] [2021-06-05 14:46:17,511 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 14:46:17,545 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:46:17,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:17,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:17,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:17,634 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 14:46:17,634 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145147266] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:17,634 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:17,635 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:17,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267450707] [2021-06-05 14:46:17,635 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:17,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:17,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:17,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:17,635 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 14:46:17,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:17,820 INFO L93 Difference]: Finished difference Result 417 states and 1196 transitions. [2021-06-05 14:46:17,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:17,820 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 14:46:17,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:17,821 INFO L225 Difference]: With dead ends: 417 [2021-06-05 14:46:17,821 INFO L226 Difference]: Without dead ends: 398 [2021-06-05 14:46:17,821 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 196.9ms TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:17,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-06-05 14:46:17,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 295. [2021-06-05 14:46:17,826 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 14:46:17,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 874 transitions. [2021-06-05 14:46:17,827 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 874 transitions. Word has length 18 [2021-06-05 14:46:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:17,827 INFO L482 AbstractCegarLoop]: Abstraction has 295 states and 874 transitions. [2021-06-05 14:46:17,827 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 14:46:17,827 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 874 transitions. [2021-06-05 14:46:17,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:17,829 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:17,829 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:18,045 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable146 [2021-06-05 14:46:18,045 INFO L430 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:18,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:18,046 INFO L82 PathProgramCache]: Analyzing trace with hash 303490843, now seen corresponding path program 3 times [2021-06-05 14:46:18,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:18,046 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846375677] [2021-06-05 14:46:18,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:18,091 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 14:46:18,092 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:18,092 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846375677] [2021-06-05 14:46:18,092 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846375677] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:18,092 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:18,092 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:18,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665092756] [2021-06-05 14:46:18,092 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:18,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:18,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:18,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:18,093 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 14:46:18,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:18,233 INFO L93 Difference]: Finished difference Result 441 states and 1242 transitions. [2021-06-05 14:46:18,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:18,234 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 14:46:18,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:18,234 INFO L225 Difference]: With dead ends: 441 [2021-06-05 14:46:18,234 INFO L226 Difference]: Without dead ends: 412 [2021-06-05 14:46:18,234 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 113.3ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:18,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2021-06-05 14:46:18,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 295. [2021-06-05 14:46:18,238 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 14:46:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 872 transitions. [2021-06-05 14:46:18,238 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 872 transitions. Word has length 18 [2021-06-05 14:46:18,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:18,239 INFO L482 AbstractCegarLoop]: Abstraction has 295 states and 872 transitions. [2021-06-05 14:46:18,239 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 14:46:18,239 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 872 transitions. [2021-06-05 14:46:18,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:18,239 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:18,239 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:18,239 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2021-06-05 14:46:18,239 INFO L430 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:18,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:18,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1861527460, now seen corresponding path program 3 times [2021-06-05 14:46:18,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:18,240 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220781811] [2021-06-05 14:46:18,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:18,266 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 14:46:18,266 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:18,266 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220781811] [2021-06-05 14:46:18,266 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220781811] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:18,266 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071606171] [2021-06-05 14:46:18,267 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 14:46:18,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:46:18,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:18,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:46:18,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:18,360 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 14:46:18,360 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071606171] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:18,360 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:18,360 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 14:46:18,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952410790] [2021-06-05 14:46:18,360 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:46:18,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:18,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:46:18,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:46:18,361 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 14:46:18,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:18,420 INFO L93 Difference]: Finished difference Result 458 states and 1290 transitions. [2021-06-05 14:46:18,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:46:18,421 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 14:46:18,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:18,421 INFO L225 Difference]: With dead ends: 458 [2021-06-05 14:46:18,421 INFO L226 Difference]: Without dead ends: 401 [2021-06-05 14:46:18,421 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 56.5ms TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:18,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2021-06-05 14:46:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 292. [2021-06-05 14:46:18,425 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 14:46:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 864 transitions. [2021-06-05 14:46:18,425 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 864 transitions. Word has length 18 [2021-06-05 14:46:18,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:18,425 INFO L482 AbstractCegarLoop]: Abstraction has 292 states and 864 transitions. [2021-06-05 14:46:18,425 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 14:46:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 864 transitions. [2021-06-05 14:46:18,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:18,426 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:18,426 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:18,640 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:18,641 INFO L430 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:18,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:18,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1997185865, now seen corresponding path program 13 times [2021-06-05 14:46:18,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:18,641 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662197461] [2021-06-05 14:46:18,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:18,688 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 14:46:18,689 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:18,689 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662197461] [2021-06-05 14:46:18,689 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662197461] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:18,689 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616074835] [2021-06-05 14:46:18,689 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 14:46:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:18,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:18,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:18,798 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 14:46:18,798 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616074835] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:18,798 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:18,798 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2021-06-05 14:46:18,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341966574] [2021-06-05 14:46:18,799 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:18,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:18,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:18,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:18,799 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 14:46:18,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:18,962 INFO L93 Difference]: Finished difference Result 491 states and 1393 transitions. [2021-06-05 14:46:18,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:18,962 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 14:46:18,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:18,963 INFO L225 Difference]: With dead ends: 491 [2021-06-05 14:46:18,963 INFO L226 Difference]: Without dead ends: 472 [2021-06-05 14:46:18,963 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 142.3ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:46:18,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-06-05 14:46:18,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 298. [2021-06-05 14:46:18,966 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 14:46:18,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 892 transitions. [2021-06-05 14:46:18,967 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 892 transitions. Word has length 18 [2021-06-05 14:46:18,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:18,967 INFO L482 AbstractCegarLoop]: Abstraction has 298 states and 892 transitions. [2021-06-05 14:46:18,967 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 14:46:18,967 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 892 transitions. [2021-06-05 14:46:18,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:18,967 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:18,967 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:19,168 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:19,168 INFO L430 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:19,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:19,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1067024689, now seen corresponding path program 14 times [2021-06-05 14:46:19,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:19,168 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399892956] [2021-06-05 14:46:19,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:19,208 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 14:46:19,208 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:19,208 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399892956] [2021-06-05 14:46:19,209 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399892956] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:19,209 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071481205] [2021-06-05 14:46:19,209 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 14:46:19,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:19,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:19,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:19,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:19,329 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 14:46:19,329 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071481205] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:19,329 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:19,329 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:46:19,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441387820] [2021-06-05 14:46:19,332 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:46:19,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:19,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:46:19,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:19,333 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 14:46:19,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:19,495 INFO L93 Difference]: Finished difference Result 479 states and 1353 transitions. [2021-06-05 14:46:19,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:19,495 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 14:46:19,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:19,496 INFO L225 Difference]: With dead ends: 479 [2021-06-05 14:46:19,496 INFO L226 Difference]: Without dead ends: 456 [2021-06-05 14:46:19,496 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 155.4ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:19,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-06-05 14:46:19,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 302. [2021-06-05 14:46:19,499 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 14:46:19,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 898 transitions. [2021-06-05 14:46:19,500 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 898 transitions. Word has length 18 [2021-06-05 14:46:19,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:19,500 INFO L482 AbstractCegarLoop]: Abstraction has 302 states and 898 transitions. [2021-06-05 14:46:19,500 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 14:46:19,500 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 898 transitions. [2021-06-05 14:46:19,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:19,500 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:19,501 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:19,715 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable157 [2021-06-05 14:46:19,716 INFO L430 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:19,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:19,716 INFO L82 PathProgramCache]: Analyzing trace with hash -435848983, now seen corresponding path program 4 times [2021-06-05 14:46:19,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:19,716 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612350473] [2021-06-05 14:46:19,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:19,735 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 14:46:19,735 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:19,736 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612350473] [2021-06-05 14:46:19,736 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612350473] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:19,736 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658203127] [2021-06-05 14:46:19,736 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 14:46:19,762 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:46:19,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:19,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:46:19,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:19,804 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 14:46:19,804 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658203127] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:19,804 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:19,804 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-06-05 14:46:19,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289711841] [2021-06-05 14:46:19,805 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:46:19,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:19,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:46:19,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:46:19,805 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 14:46:19,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:19,844 INFO L93 Difference]: Finished difference Result 566 states and 1645 transitions. [2021-06-05 14:46:19,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:46:19,844 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 14:46:19,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:19,845 INFO L225 Difference]: With dead ends: 566 [2021-06-05 14:46:19,845 INFO L226 Difference]: Without dead ends: 517 [2021-06-05 14:46:19,845 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 38.1ms TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:19,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2021-06-05 14:46:19,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 311. [2021-06-05 14:46:19,849 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 14:46:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 943 transitions. [2021-06-05 14:46:19,849 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 943 transitions. Word has length 18 [2021-06-05 14:46:19,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:19,850 INFO L482 AbstractCegarLoop]: Abstraction has 311 states and 943 transitions. [2021-06-05 14:46:19,850 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 14:46:19,850 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 943 transitions. [2021-06-05 14:46:19,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:19,850 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:19,850 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:20,066 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:20,066 INFO L430 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:20,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:20,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1726676173, now seen corresponding path program 15 times [2021-06-05 14:46:20,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:20,067 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743222238] [2021-06-05 14:46:20,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:20,145 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 14:46:20,146 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:20,146 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743222238] [2021-06-05 14:46:20,146 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743222238] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:20,146 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508844874] [2021-06-05 14:46:20,146 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 14:46:20,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:46:20,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:20,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:20,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:20,259 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 14:46:20,259 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508844874] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:20,259 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:20,259 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 14:46:20,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052248604] [2021-06-05 14:46:20,259 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:46:20,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:20,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:46:20,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:20,260 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 14:46:20,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:20,445 INFO L93 Difference]: Finished difference Result 516 states and 1480 transitions. [2021-06-05 14:46:20,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:20,445 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 14:46:20,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:20,446 INFO L225 Difference]: With dead ends: 516 [2021-06-05 14:46:20,446 INFO L226 Difference]: Without dead ends: 497 [2021-06-05 14:46:20,446 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 191.7ms TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:46:20,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2021-06-05 14:46:20,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 308. [2021-06-05 14:46:20,450 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 14:46:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 940 transitions. [2021-06-05 14:46:20,450 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 940 transitions. Word has length 18 [2021-06-05 14:46:20,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:20,450 INFO L482 AbstractCegarLoop]: Abstraction has 308 states and 940 transitions. [2021-06-05 14:46:20,450 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 14:46:20,451 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 940 transitions. [2021-06-05 14:46:20,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:20,451 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:20,451 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:20,664 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable166 [2021-06-05 14:46:20,665 INFO L430 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:20,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:20,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1907804621, now seen corresponding path program 16 times [2021-06-05 14:46:20,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:20,666 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551912845] [2021-06-05 14:46:20,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:20,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 14:46:20,708 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:20,708 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551912845] [2021-06-05 14:46:20,708 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551912845] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:20,708 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709580838] [2021-06-05 14:46:20,708 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 14:46:20,735 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:46:20,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:20,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:20,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:20,810 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 14:46:20,810 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709580838] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:20,810 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:20,810 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:20,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017098918] [2021-06-05 14:46:20,810 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:20,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:20,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:20,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:20,811 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 14:46:20,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:20,930 INFO L93 Difference]: Finished difference Result 497 states and 1451 transitions. [2021-06-05 14:46:20,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:20,930 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 14:46:20,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:20,931 INFO L225 Difference]: With dead ends: 497 [2021-06-05 14:46:20,931 INFO L226 Difference]: Without dead ends: 478 [2021-06-05 14:46:20,931 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 107.9ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:46:20,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-06-05 14:46:20,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 304. [2021-06-05 14:46:20,934 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 14:46:20,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 920 transitions. [2021-06-05 14:46:20,935 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 920 transitions. Word has length 18 [2021-06-05 14:46:20,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:20,935 INFO L482 AbstractCegarLoop]: Abstraction has 304 states and 920 transitions. [2021-06-05 14:46:20,935 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 14:46:20,935 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 920 transitions. [2021-06-05 14:46:20,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:20,935 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:20,935 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:21,148 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:21,149 INFO L430 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:21,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:21,149 INFO L82 PathProgramCache]: Analyzing trace with hash 398774047, now seen corresponding path program 5 times [2021-06-05 14:46:21,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:21,149 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992582226] [2021-06-05 14:46:21,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:21,193 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 14:46:21,193 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:21,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992582226] [2021-06-05 14:46:21,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992582226] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:21,193 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:21,193 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:46:21,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832704000] [2021-06-05 14:46:21,194 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:46:21,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:21,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:46:21,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:46:21,194 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 14:46:21,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:21,259 INFO L93 Difference]: Finished difference Result 514 states and 1465 transitions. [2021-06-05 14:46:21,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:46:21,259 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 14:46:21,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:21,260 INFO L225 Difference]: With dead ends: 514 [2021-06-05 14:46:21,260 INFO L226 Difference]: Without dead ends: 452 [2021-06-05 14:46:21,260 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 58.3ms TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:46:21,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-06-05 14:46:21,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 296. [2021-06-05 14:46:21,263 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 14:46:21,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 889 transitions. [2021-06-05 14:46:21,264 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 889 transitions. Word has length 18 [2021-06-05 14:46:21,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:21,264 INFO L482 AbstractCegarLoop]: Abstraction has 296 states and 889 transitions. [2021-06-05 14:46:21,264 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 14:46:21,264 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 889 transitions. [2021-06-05 14:46:21,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:21,264 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:21,264 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:21,265 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2021-06-05 14:46:21,265 INFO L430 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:21,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:21,265 INFO L82 PathProgramCache]: Analyzing trace with hash 505869899, now seen corresponding path program 17 times [2021-06-05 14:46:21,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:21,265 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005272697] [2021-06-05 14:46:21,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:21,305 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 14:46:21,305 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:21,305 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005272697] [2021-06-05 14:46:21,305 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005272697] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:21,305 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381681852] [2021-06-05 14:46:21,305 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 14:46:21,332 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:21,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:21,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:21,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:21,405 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 14:46:21,405 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381681852] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:21,405 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:21,405 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:21,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969203020] [2021-06-05 14:46:21,406 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:21,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:21,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:21,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:21,406 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 14:46:21,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:21,595 INFO L93 Difference]: Finished difference Result 450 states and 1288 transitions. [2021-06-05 14:46:21,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:21,595 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 14:46:21,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:21,596 INFO L225 Difference]: With dead ends: 450 [2021-06-05 14:46:21,596 INFO L226 Difference]: Without dead ends: 427 [2021-06-05 14:46:21,596 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 175.0ms TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:46:21,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-06-05 14:46:21,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 304. [2021-06-05 14:46:21,599 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 14:46:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 911 transitions. [2021-06-05 14:46:21,600 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 911 transitions. Word has length 18 [2021-06-05 14:46:21,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:21,600 INFO L482 AbstractCegarLoop]: Abstraction has 304 states and 911 transitions. [2021-06-05 14:46:21,600 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 14:46:21,600 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 911 transitions. [2021-06-05 14:46:21,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:21,600 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:21,600 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:21,801 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174,21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:21,801 INFO L430 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:21,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:21,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1484427343, now seen corresponding path program 18 times [2021-06-05 14:46:21,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:21,801 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201323840] [2021-06-05 14:46:21,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:21,865 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 14:46:21,865 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:21,865 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201323840] [2021-06-05 14:46:21,865 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201323840] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:21,865 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156198524] [2021-06-05 14:46:21,866 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 14:46:21,891 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:46:21,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:21,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:21,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:21,965 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 14:46:21,965 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156198524] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:21,965 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:21,965 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:21,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052106685] [2021-06-05 14:46:21,965 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:21,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:21,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:21,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:21,966 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 14:46:22,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:22,129 INFO L93 Difference]: Finished difference Result 434 states and 1258 transitions. [2021-06-05 14:46:22,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:22,129 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 14:46:22,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:22,130 INFO L225 Difference]: With dead ends: 434 [2021-06-05 14:46:22,130 INFO L226 Difference]: Without dead ends: 415 [2021-06-05 14:46:22,130 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 164.6ms TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:46:22,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2021-06-05 14:46:22,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 296. [2021-06-05 14:46:22,133 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 14:46:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 889 transitions. [2021-06-05 14:46:22,133 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 889 transitions. Word has length 18 [2021-06-05 14:46:22,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:22,133 INFO L482 AbstractCegarLoop]: Abstraction has 296 states and 889 transitions. [2021-06-05 14:46:22,133 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 14:46:22,133 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 889 transitions. [2021-06-05 14:46:22,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:22,134 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:22,134 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:22,335 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable179 [2021-06-05 14:46:22,336 INFO L430 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:22,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:22,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1410127391, now seen corresponding path program 19 times [2021-06-05 14:46:22,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:22,336 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145800567] [2021-06-05 14:46:22,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:22,387 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 14:46:22,387 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:22,387 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145800567] [2021-06-05 14:46:22,387 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145800567] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:22,387 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103380263] [2021-06-05 14:46:22,388 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 14:46:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:22,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:22,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:22,490 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 14:46:22,490 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103380263] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:22,490 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:22,490 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 14:46:22,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842233073] [2021-06-05 14:46:22,490 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:46:22,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:22,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:46:22,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:22,491 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 14:46:22,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:22,673 INFO L93 Difference]: Finished difference Result 468 states and 1339 transitions. [2021-06-05 14:46:22,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:22,673 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 14:46:22,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:22,674 INFO L225 Difference]: With dead ends: 468 [2021-06-05 14:46:22,674 INFO L226 Difference]: Without dead ends: 449 [2021-06-05 14:46:22,674 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 197.0ms TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:46:22,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-06-05 14:46:22,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 302. [2021-06-05 14:46:22,677 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 14:46:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 910 transitions. [2021-06-05 14:46:22,677 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 910 transitions. Word has length 18 [2021-06-05 14:46:22,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:22,678 INFO L482 AbstractCegarLoop]: Abstraction has 302 states and 910 transitions. [2021-06-05 14:46:22,678 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 14:46:22,678 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 910 transitions. [2021-06-05 14:46:22,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:22,678 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:22,678 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:22,880 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:22,881 INFO L430 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:22,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:22,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1565959223, now seen corresponding path program 20 times [2021-06-05 14:46:22,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:22,881 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739268722] [2021-06-05 14:46:22,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:22,940 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 14:46:22,940 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:22,940 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739268722] [2021-06-05 14:46:22,940 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739268722] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:22,940 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674406946] [2021-06-05 14:46:22,940 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 14:46:22,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:22,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:22,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:22,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:23,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 14:46:23,049 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674406946] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:23,049 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:23,049 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 14:46:23,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984248469] [2021-06-05 14:46:23,050 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:46:23,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:23,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:46:23,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:23,050 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 14:46:23,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:23,245 INFO L93 Difference]: Finished difference Result 479 states and 1352 transitions. [2021-06-05 14:46:23,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:23,245 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 14:46:23,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:23,246 INFO L225 Difference]: With dead ends: 479 [2021-06-05 14:46:23,246 INFO L226 Difference]: Without dead ends: 460 [2021-06-05 14:46:23,246 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 219.1ms TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:46:23,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-06-05 14:46:23,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 306. [2021-06-05 14:46:23,250 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 14:46:23,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 926 transitions. [2021-06-05 14:46:23,250 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 926 transitions. Word has length 18 [2021-06-05 14:46:23,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:23,250 INFO L482 AbstractCegarLoop]: Abstraction has 306 states and 926 transitions. [2021-06-05 14:46:23,250 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 14:46:23,250 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 926 transitions. [2021-06-05 14:46:23,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:23,251 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:23,251 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:23,451 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:23,451 INFO L430 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:23,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:23,451 INFO L82 PathProgramCache]: Analyzing trace with hash -635798047, now seen corresponding path program 21 times [2021-06-05 14:46:23,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:23,452 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117674868] [2021-06-05 14:46:23,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:23,498 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 14:46:23,498 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:23,498 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117674868] [2021-06-05 14:46:23,499 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117674868] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:23,499 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253183918] [2021-06-05 14:46:23,499 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 14:46:23,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:46:23,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:23,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:23,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:23,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 14:46:23,624 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253183918] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:23,624 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:23,625 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:23,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306253404] [2021-06-05 14:46:23,625 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:23,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:23,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:23,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:23,625 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 14:46:23,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:23,829 INFO L93 Difference]: Finished difference Result 442 states and 1266 transitions. [2021-06-05 14:46:23,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:23,829 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 14:46:23,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:23,829 INFO L225 Difference]: With dead ends: 442 [2021-06-05 14:46:23,829 INFO L226 Difference]: Without dead ends: 419 [2021-06-05 14:46:23,830 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 208.6ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:23,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-06-05 14:46:23,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 308. [2021-06-05 14:46:23,833 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 14:46:23,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 927 transitions. [2021-06-05 14:46:23,833 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 927 transitions. Word has length 18 [2021-06-05 14:46:23,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:23,833 INFO L482 AbstractCegarLoop]: Abstraction has 308 states and 927 transitions. [2021-06-05 14:46:23,833 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 14:46:23,833 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 927 transitions. [2021-06-05 14:46:23,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:23,834 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:23,834 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:24,034 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:24,034 INFO L430 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:24,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:24,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1614261531, now seen corresponding path program 22 times [2021-06-05 14:46:24,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:24,035 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316135745] [2021-06-05 14:46:24,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:24,087 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 14:46:24,087 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:24,087 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316135745] [2021-06-05 14:46:24,087 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316135745] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:24,087 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186367204] [2021-06-05 14:46:24,087 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 14:46:24,118 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:46:24,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:24,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:24,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:24,191 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 14:46:24,192 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186367204] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:24,192 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:24,192 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 14:46:24,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093455320] [2021-06-05 14:46:24,192 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:46:24,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:24,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:46:24,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:24,192 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 14:46:24,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:24,341 INFO L93 Difference]: Finished difference Result 535 states and 1530 transitions. [2021-06-05 14:46:24,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:24,341 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 14:46:24,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:24,342 INFO L225 Difference]: With dead ends: 535 [2021-06-05 14:46:24,342 INFO L226 Difference]: Without dead ends: 516 [2021-06-05 14:46:24,342 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 158.8ms TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:46:24,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2021-06-05 14:46:24,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 303. [2021-06-05 14:46:24,345 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 14:46:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 914 transitions. [2021-06-05 14:46:24,346 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 914 transitions. Word has length 18 [2021-06-05 14:46:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:24,346 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 914 transitions. [2021-06-05 14:46:24,346 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 14:46:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 914 transitions. [2021-06-05 14:46:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:24,346 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:24,346 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:24,547 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable193 [2021-06-05 14:46:24,547 INFO L430 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:24,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:24,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1839327131, now seen corresponding path program 23 times [2021-06-05 14:46:24,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:24,547 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942349971] [2021-06-05 14:46:24,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:24,582 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 14:46:24,582 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:24,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942349971] [2021-06-05 14:46:24,582 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942349971] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:24,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922711334] [2021-06-05 14:46:24,582 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 14:46:24,613 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:24,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:24,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:24,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:24,680 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 14:46:24,680 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922711334] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:24,680 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:24,680 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:24,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288536133] [2021-06-05 14:46:24,680 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:24,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:24,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:24,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:24,681 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 14:46:24,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:24,811 INFO L93 Difference]: Finished difference Result 537 states and 1559 transitions. [2021-06-05 14:46:24,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:24,811 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 14:46:24,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:24,812 INFO L225 Difference]: With dead ends: 537 [2021-06-05 14:46:24,812 INFO L226 Difference]: Without dead ends: 518 [2021-06-05 14:46:24,812 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 111.6ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:24,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2021-06-05 14:46:24,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 307. [2021-06-05 14:46:24,816 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 14:46:24,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 934 transitions. [2021-06-05 14:46:24,816 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 934 transitions. Word has length 18 [2021-06-05 14:46:24,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:24,816 INFO L482 AbstractCegarLoop]: Abstraction has 307 states and 934 transitions. [2021-06-05 14:46:24,816 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 14:46:24,816 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 934 transitions. [2021-06-05 14:46:24,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:24,817 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:24,817 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:25,017 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:25,017 INFO L430 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:25,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:25,017 INFO L82 PathProgramCache]: Analyzing trace with hash 756919777, now seen corresponding path program 24 times [2021-06-05 14:46:25,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:25,018 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67439745] [2021-06-05 14:46:25,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:25,054 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 14:46:25,054 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:25,055 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67439745] [2021-06-05 14:46:25,055 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67439745] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:25,055 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592767684] [2021-06-05 14:46:25,055 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 14:46:25,079 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:46:25,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:25,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:25,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:25,141 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 14:46:25,141 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592767684] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:25,141 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:25,141 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 14:46:25,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490561414] [2021-06-05 14:46:25,142 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:46:25,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:25,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:46:25,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:46:25,142 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 14:46:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:25,252 INFO L93 Difference]: Finished difference Result 500 states and 1473 transitions. [2021-06-05 14:46:25,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:25,252 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 14:46:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:25,253 INFO L225 Difference]: With dead ends: 500 [2021-06-05 14:46:25,253 INFO L226 Difference]: Without dead ends: 481 [2021-06-05 14:46:25,253 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 90.1ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:25,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-06-05 14:46:25,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 299. [2021-06-05 14:46:25,256 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 14:46:25,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 898 transitions. [2021-06-05 14:46:25,257 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 898 transitions. Word has length 18 [2021-06-05 14:46:25,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:25,257 INFO L482 AbstractCegarLoop]: Abstraction has 299 states and 898 transitions. [2021-06-05 14:46:25,257 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 14:46:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 898 transitions. [2021-06-05 14:46:25,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:25,257 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:25,257 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:25,458 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable199 [2021-06-05 14:46:25,458 INFO L430 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:25,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:25,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1237003341, now seen corresponding path program 25 times [2021-06-05 14:46:25,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:25,458 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631886036] [2021-06-05 14:46:25,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:25,509 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 14:46:25,509 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:25,510 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631886036] [2021-06-05 14:46:25,510 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631886036] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:25,510 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028537675] [2021-06-05 14:46:25,510 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 14:46:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:25,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:25,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:25,612 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 14:46:25,612 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028537675] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:25,612 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:25,612 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 14:46:25,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832934782] [2021-06-05 14:46:25,612 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:46:25,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:25,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:46:25,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:25,613 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 14:46:25,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:25,769 INFO L93 Difference]: Finished difference Result 506 states and 1446 transitions. [2021-06-05 14:46:25,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:25,769 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 14:46:25,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:25,770 INFO L225 Difference]: With dead ends: 506 [2021-06-05 14:46:25,770 INFO L226 Difference]: Without dead ends: 487 [2021-06-05 14:46:25,770 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 158.9ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:25,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2021-06-05 14:46:25,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 305. [2021-06-05 14:46:25,773 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 14:46:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 925 transitions. [2021-06-05 14:46:25,774 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 925 transitions. Word has length 18 [2021-06-05 14:46:25,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:25,774 INFO L482 AbstractCegarLoop]: Abstraction has 305 states and 925 transitions. [2021-06-05 14:46:25,774 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 14:46:25,774 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 925 transitions. [2021-06-05 14:46:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:25,774 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:25,774 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:25,992 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable202 [2021-06-05 14:46:25,993 INFO L430 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:25,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:25,993 INFO L82 PathProgramCache]: Analyzing trace with hash -2127802779, now seen corresponding path program 26 times [2021-06-05 14:46:25,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:25,993 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144926549] [2021-06-05 14:46:25,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:26,054 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 14:46:26,054 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:26,054 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144926549] [2021-06-05 14:46:26,054 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144926549] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:26,054 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142933178] [2021-06-05 14:46:26,054 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 14:46:26,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:26,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:26,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:26,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:26,168 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 14:46:26,168 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142933178] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:26,168 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:26,168 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:26,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607367470] [2021-06-05 14:46:26,168 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:26,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:26,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:26,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:26,169 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 14:46:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:26,337 INFO L93 Difference]: Finished difference Result 494 states and 1406 transitions. [2021-06-05 14:46:26,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:26,337 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 14:46:26,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:26,338 INFO L225 Difference]: With dead ends: 494 [2021-06-05 14:46:26,338 INFO L226 Difference]: Without dead ends: 471 [2021-06-05 14:46:26,338 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 180.8ms TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:46:26,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2021-06-05 14:46:26,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 307. [2021-06-05 14:46:26,342 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 14:46:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 926 transitions. [2021-06-05 14:46:26,342 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 926 transitions. Word has length 18 [2021-06-05 14:46:26,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:26,342 INFO L482 AbstractCegarLoop]: Abstraction has 307 states and 926 transitions. [2021-06-05 14:46:26,342 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 14:46:26,342 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 926 transitions. [2021-06-05 14:46:26,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:26,343 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:26,343 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:26,543 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable205 [2021-06-05 14:46:26,543 INFO L430 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:26,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:26,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1507513033, now seen corresponding path program 27 times [2021-06-05 14:46:26,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:26,544 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753591502] [2021-06-05 14:46:26,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:26,595 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 14:46:26,595 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:26,596 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753591502] [2021-06-05 14:46:26,596 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753591502] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:26,596 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903789899] [2021-06-05 14:46:26,596 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 14:46:26,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:46:26,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:26,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:26,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:26,693 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 14:46:26,693 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903789899] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:26,693 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:26,693 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 14:46:26,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259768916] [2021-06-05 14:46:26,693 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:46:26,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:26,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:46:26,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:26,694 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 14:46:26,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:26,906 INFO L93 Difference]: Finished difference Result 509 states and 1449 transitions. [2021-06-05 14:46:26,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:26,906 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 14:46:26,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:26,907 INFO L225 Difference]: With dead ends: 509 [2021-06-05 14:46:26,907 INFO L226 Difference]: Without dead ends: 490 [2021-06-05 14:46:26,907 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 200.4ms TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:46:26,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-06-05 14:46:26,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 304. [2021-06-05 14:46:26,910 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 14:46:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 923 transitions. [2021-06-05 14:46:26,911 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 923 transitions. Word has length 18 [2021-06-05 14:46:26,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:26,911 INFO L482 AbstractCegarLoop]: Abstraction has 304 states and 923 transitions. [2021-06-05 14:46:26,911 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 14:46:26,911 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 923 transitions. [2021-06-05 14:46:26,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:26,911 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:26,911 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:27,112 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:27,112 INFO L430 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:27,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:27,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1326384585, now seen corresponding path program 28 times [2021-06-05 14:46:27,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:27,112 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519433389] [2021-06-05 14:46:27,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:27,147 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 14:46:27,147 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:27,147 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519433389] [2021-06-05 14:46:27,147 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519433389] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:27,147 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825961440] [2021-06-05 14:46:27,147 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 14:46:27,171 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:46:27,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:27,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:27,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:27,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 14:46:27,234 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825961440] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:27,234 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:27,235 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:46:27,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060958755] [2021-06-05 14:46:27,235 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:46:27,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:27,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:46:27,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:27,235 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 14:46:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:27,337 INFO L93 Difference]: Finished difference Result 490 states and 1420 transitions. [2021-06-05 14:46:27,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:27,337 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 14:46:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:27,338 INFO L225 Difference]: With dead ends: 490 [2021-06-05 14:46:27,338 INFO L226 Difference]: Without dead ends: 471 [2021-06-05 14:46:27,338 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 97.5ms TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:27,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2021-06-05 14:46:27,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 300. [2021-06-05 14:46:27,344 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 14:46:27,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 903 transitions. [2021-06-05 14:46:27,345 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 903 transitions. Word has length 18 [2021-06-05 14:46:27,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:27,345 INFO L482 AbstractCegarLoop]: Abstraction has 300 states and 903 transitions. [2021-06-05 14:46:27,345 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 14:46:27,345 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 903 transitions. [2021-06-05 14:46:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:27,345 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:27,346 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:27,546 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable214 [2021-06-05 14:46:27,546 INFO L430 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:27,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:27,546 INFO L82 PathProgramCache]: Analyzing trace with hash -554908191, now seen corresponding path program 29 times [2021-06-05 14:46:27,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:27,546 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861180200] [2021-06-05 14:46:27,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:27,584 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 14:46:27,584 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:27,584 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861180200] [2021-06-05 14:46:27,584 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861180200] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:27,584 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981025603] [2021-06-05 14:46:27,584 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 14:46:27,610 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:27,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:27,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:27,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:27,677 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 14:46:27,678 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981025603] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:27,678 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:27,678 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:46:27,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017084492] [2021-06-05 14:46:27,678 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:46:27,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:27,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:46:27,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:27,678 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 14:46:27,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:27,852 INFO L93 Difference]: Finished difference Result 447 states and 1285 transitions. [2021-06-05 14:46:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:27,853 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 14:46:27,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:27,853 INFO L225 Difference]: With dead ends: 447 [2021-06-05 14:46:27,853 INFO L226 Difference]: Without dead ends: 424 [2021-06-05 14:46:27,853 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 157.5ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:27,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2021-06-05 14:46:27,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 308. [2021-06-05 14:46:27,856 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 14:46:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 925 transitions. [2021-06-05 14:46:27,857 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 925 transitions. Word has length 18 [2021-06-05 14:46:27,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:27,857 INFO L482 AbstractCegarLoop]: Abstraction has 308 states and 925 transitions. [2021-06-05 14:46:27,857 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 14:46:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 925 transitions. [2021-06-05 14:46:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:27,858 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:27,858 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:28,060 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable217 [2021-06-05 14:46:28,061 INFO L430 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:28,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:28,061 INFO L82 PathProgramCache]: Analyzing trace with hash 423649253, now seen corresponding path program 30 times [2021-06-05 14:46:28,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:28,061 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354894274] [2021-06-05 14:46:28,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:28,101 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 14:46:28,101 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:28,101 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354894274] [2021-06-05 14:46:28,101 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354894274] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:28,101 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544067478] [2021-06-05 14:46:28,101 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 14:46:28,126 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:46:28,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:28,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:28,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:28,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 14:46:28,187 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544067478] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:28,187 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:28,187 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:46:28,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696994807] [2021-06-05 14:46:28,187 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:46:28,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:28,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:46:28,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:28,187 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 14:46:28,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:28,347 INFO L93 Difference]: Finished difference Result 431 states and 1255 transitions. [2021-06-05 14:46:28,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:28,347 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 14:46:28,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:28,348 INFO L225 Difference]: With dead ends: 431 [2021-06-05 14:46:28,348 INFO L226 Difference]: Without dead ends: 412 [2021-06-05 14:46:28,348 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 146.6ms TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:28,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2021-06-05 14:46:28,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 299. [2021-06-05 14:46:28,351 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 14:46:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 898 transitions. [2021-06-05 14:46:28,351 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 898 transitions. Word has length 18 [2021-06-05 14:46:28,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:28,351 INFO L482 AbstractCegarLoop]: Abstraction has 299 states and 898 transitions. [2021-06-05 14:46:28,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 14:46:28,352 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 898 transitions. [2021-06-05 14:46:28,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:28,352 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:28,352 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:28,564 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable222 [2021-06-05 14:46:28,565 INFO L430 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:28,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:28,565 INFO L82 PathProgramCache]: Analyzing trace with hash 427729059, now seen corresponding path program 31 times [2021-06-05 14:46:28,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:28,565 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155175579] [2021-06-05 14:46:28,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:28,611 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 14:46:28,612 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:28,612 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155175579] [2021-06-05 14:46:28,612 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155175579] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:28,612 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466850099] [2021-06-05 14:46:28,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 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 14:46:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:28,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:28,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:28,710 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 14:46:28,711 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466850099] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:28,711 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:28,711 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:28,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160503702] [2021-06-05 14:46:28,711 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:28,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:28,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:28,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:28,711 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 14:46:28,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:28,837 INFO L93 Difference]: Finished difference Result 569 states and 1629 transitions. [2021-06-05 14:46:28,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:28,837 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 14:46:28,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:28,838 INFO L225 Difference]: With dead ends: 569 [2021-06-05 14:46:28,838 INFO L226 Difference]: Without dead ends: 550 [2021-06-05 14:46:28,838 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 136.0ms TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-06-05 14:46:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 306. [2021-06-05 14:46:28,842 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 14:46:28,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 926 transitions. [2021-06-05 14:46:28,842 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 926 transitions. Word has length 18 [2021-06-05 14:46:28,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:28,842 INFO L482 AbstractCegarLoop]: Abstraction has 306 states and 926 transitions. [2021-06-05 14:46:28,842 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 14:46:28,842 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 926 transitions. [2021-06-05 14:46:28,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:28,843 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:28,843 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:29,043 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable225 [2021-06-05 14:46:29,043 INFO L430 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:29,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:29,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1635282131, now seen corresponding path program 32 times [2021-06-05 14:46:29,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:29,044 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960097756] [2021-06-05 14:46:29,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:29,082 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 14:46:29,082 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:29,082 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960097756] [2021-06-05 14:46:29,082 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960097756] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:29,082 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504448033] [2021-06-05 14:46:29,083 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 14:46:29,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:29,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:29,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:29,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:29,164 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 14:46:29,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504448033] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:29,165 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:29,165 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 14:46:29,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494982167] [2021-06-05 14:46:29,165 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:46:29,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:29,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:46:29,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:46:29,165 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 14:46:29,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:29,266 INFO L93 Difference]: Finished difference Result 581 states and 1668 transitions. [2021-06-05 14:46:29,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:29,266 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 14:46:29,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:29,267 INFO L225 Difference]: With dead ends: 581 [2021-06-05 14:46:29,267 INFO L226 Difference]: Without dead ends: 562 [2021-06-05 14:46:29,267 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 87.3ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:29,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2021-06-05 14:46:29,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 310. [2021-06-05 14:46:29,271 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 14:46:29,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 946 transitions. [2021-06-05 14:46:29,271 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 946 transitions. Word has length 18 [2021-06-05 14:46:29,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:29,271 INFO L482 AbstractCegarLoop]: Abstraction has 310 states and 946 transitions. [2021-06-05 14:46:29,271 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 14:46:29,271 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 946 transitions. [2021-06-05 14:46:29,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:29,272 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:29,272 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:29,472 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable228,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:29,472 INFO L430 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:29,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:29,473 INFO L82 PathProgramCache]: Analyzing trace with hash -63438257, now seen corresponding path program 33 times [2021-06-05 14:46:29,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:29,473 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737842483] [2021-06-05 14:46:29,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:29,513 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 14:46:29,513 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:29,513 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737842483] [2021-06-05 14:46:29,513 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737842483] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:29,513 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005061582] [2021-06-05 14:46:29,513 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 14:46:29,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:46:29,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:29,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:29,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:29,606 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 14:46:29,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005061582] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:29,606 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:29,607 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:29,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917294783] [2021-06-05 14:46:29,607 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:29,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:29,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:29,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:29,607 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 14:46:29,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:29,740 INFO L93 Difference]: Finished difference Result 590 states and 1691 transitions. [2021-06-05 14:46:29,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:29,740 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 14:46:29,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:29,741 INFO L225 Difference]: With dead ends: 590 [2021-06-05 14:46:29,741 INFO L226 Difference]: Without dead ends: 571 [2021-06-05 14:46:29,741 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 113.6ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:29,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-06-05 14:46:29,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 299. [2021-06-05 14:46:29,745 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 14:46:29,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 898 transitions. [2021-06-05 14:46:29,745 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 898 transitions. Word has length 18 [2021-06-05 14:46:29,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:29,745 INFO L482 AbstractCegarLoop]: Abstraction has 299 states and 898 transitions. [2021-06-05 14:46:29,745 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 14:46:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 898 transitions. [2021-06-05 14:46:29,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:29,746 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:29,746 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:29,961 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable231,37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:29,961 INFO L430 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:29,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:29,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1646468570, now seen corresponding path program 4 times [2021-06-05 14:46:29,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:29,961 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244163048] [2021-06-05 14:46:29,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:29,993 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 14:46:29,993 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:29,993 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244163048] [2021-06-05 14:46:29,993 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244163048] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:29,994 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:29,994 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:46:29,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076885407] [2021-06-05 14:46:29,994 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:46:29,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:29,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:46:29,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:46:29,994 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 14:46:30,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:30,053 INFO L93 Difference]: Finished difference Result 429 states and 1249 transitions. [2021-06-05 14:46:30,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:46:30,054 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 14:46:30,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:30,054 INFO L225 Difference]: With dead ends: 429 [2021-06-05 14:46:30,054 INFO L226 Difference]: Without dead ends: 358 [2021-06-05 14:46:30,054 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 45.0ms TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:46:30,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-06-05 14:46:30,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 294. [2021-06-05 14:46:30,057 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 14:46:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 879 transitions. [2021-06-05 14:46:30,058 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 879 transitions. Word has length 18 [2021-06-05 14:46:30,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:30,058 INFO L482 AbstractCegarLoop]: Abstraction has 294 states and 879 transitions. [2021-06-05 14:46:30,058 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 14:46:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 879 transitions. [2021-06-05 14:46:30,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:30,058 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:30,058 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:30,058 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable234 [2021-06-05 14:46:30,058 INFO L430 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:30,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:30,058 INFO L82 PathProgramCache]: Analyzing trace with hash -269670517, now seen corresponding path program 34 times [2021-06-05 14:46:30,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:30,059 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115150974] [2021-06-05 14:46:30,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:30,102 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 14:46:30,103 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:30,103 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115150974] [2021-06-05 14:46:30,103 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115150974] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:30,103 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661404024] [2021-06-05 14:46:30,103 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 14:46:30,127 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:46:30,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:30,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:30,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:30,207 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 14:46:30,207 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661404024] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:30,207 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:30,207 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 14:46:30,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900034530] [2021-06-05 14:46:30,207 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:46:30,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:30,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:46:30,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:30,208 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 14:46:30,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:30,377 INFO L93 Difference]: Finished difference Result 648 states and 1820 transitions. [2021-06-05 14:46:30,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:30,377 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 14:46:30,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:30,378 INFO L225 Difference]: With dead ends: 648 [2021-06-05 14:46:30,378 INFO L226 Difference]: Without dead ends: 629 [2021-06-05 14:46:30,378 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 180.9ms TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:46:30,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-06-05 14:46:30,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 298. [2021-06-05 14:46:30,382 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 14:46:30,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 889 transitions. [2021-06-05 14:46:30,382 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 889 transitions. Word has length 18 [2021-06-05 14:46:30,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:30,383 INFO L482 AbstractCegarLoop]: Abstraction has 298 states and 889 transitions. [2021-06-05 14:46:30,383 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 14:46:30,383 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 889 transitions. [2021-06-05 14:46:30,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:30,383 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:30,383 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:30,584 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable235 [2021-06-05 14:46:30,584 INFO L430 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:30,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:30,585 INFO L82 PathProgramCache]: Analyzing trace with hash -472443849, now seen corresponding path program 35 times [2021-06-05 14:46:30,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:30,585 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013238369] [2021-06-05 14:46:30,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:30,622 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 14:46:30,622 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:30,622 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013238369] [2021-06-05 14:46:30,622 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013238369] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:30,622 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898873193] [2021-06-05 14:46:30,622 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 14:46:30,652 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:30,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:30,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:30,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:30,725 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 14:46:30,725 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898873193] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:30,725 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:30,726 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:30,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876311742] [2021-06-05 14:46:30,726 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:30,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:30,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:30,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:30,726 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 14:46:30,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:30,910 INFO L93 Difference]: Finished difference Result 606 states and 1708 transitions. [2021-06-05 14:46:30,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:30,910 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 14:46:30,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:30,911 INFO L225 Difference]: With dead ends: 606 [2021-06-05 14:46:30,911 INFO L226 Difference]: Without dead ends: 583 [2021-06-05 14:46:30,911 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 184.4ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:30,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-06-05 14:46:30,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 306. [2021-06-05 14:46:30,914 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 14:46:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 911 transitions. [2021-06-05 14:46:30,915 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 911 transitions. Word has length 18 [2021-06-05 14:46:30,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:30,915 INFO L482 AbstractCegarLoop]: Abstraction has 306 states and 911 transitions. [2021-06-05 14:46:30,915 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 14:46:30,915 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 911 transitions. [2021-06-05 14:46:30,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:30,915 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:30,916 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:31,116 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable238 [2021-06-05 14:46:31,116 INFO L430 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:31,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:31,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1687803469, now seen corresponding path program 36 times [2021-06-05 14:46:31,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:31,116 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649756106] [2021-06-05 14:46:31,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:31,157 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 14:46:31,157 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:31,157 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649756106] [2021-06-05 14:46:31,157 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649756106] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:31,157 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193198443] [2021-06-05 14:46:31,157 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 14:46:31,182 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:46:31,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:31,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:31,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:31,273 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 14:46:31,273 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193198443] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:31,273 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:31,274 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:31,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169214074] [2021-06-05 14:46:31,274 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:31,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:31,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:31,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:31,274 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 14:46:31,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:31,459 INFO L93 Difference]: Finished difference Result 590 states and 1678 transitions. [2021-06-05 14:46:31,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:31,459 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 14:46:31,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:31,459 INFO L225 Difference]: With dead ends: 590 [2021-06-05 14:46:31,459 INFO L226 Difference]: Without dead ends: 571 [2021-06-05 14:46:31,460 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 184.2ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:31,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-06-05 14:46:31,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 294. [2021-06-05 14:46:31,463 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 14:46:31,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 879 transitions. [2021-06-05 14:46:31,464 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 879 transitions. Word has length 18 [2021-06-05 14:46:31,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:31,464 INFO L482 AbstractCegarLoop]: Abstraction has 294 states and 879 transitions. [2021-06-05 14:46:31,464 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 14:46:31,464 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 879 transitions. [2021-06-05 14:46:31,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:31,464 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:31,464 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:31,664 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable243 [2021-06-05 14:46:31,664 INFO L430 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:31,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:31,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1039285976, now seen corresponding path program 5 times [2021-06-05 14:46:31,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:31,665 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854751154] [2021-06-05 14:46:31,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:31,689 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 14:46:31,689 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:31,689 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854751154] [2021-06-05 14:46:31,689 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854751154] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:31,689 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376378985] [2021-06-05 14:46:31,689 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 14:46:31,713 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:31,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:31,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:46:31,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:31,770 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 14:46:31,771 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376378985] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:31,771 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:31,771 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 14:46:31,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824495646] [2021-06-05 14:46:31,771 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:46:31,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:31,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:46:31,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:46:31,771 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 14:46:31,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:31,826 INFO L93 Difference]: Finished difference Result 448 states and 1287 transitions. [2021-06-05 14:46:31,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:46:31,826 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 14:46:31,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:31,827 INFO L225 Difference]: With dead ends: 448 [2021-06-05 14:46:31,827 INFO L226 Difference]: Without dead ends: 391 [2021-06-05 14:46:31,827 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 59.3ms TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:31,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-06-05 14:46:31,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 287. [2021-06-05 14:46:31,830 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 14:46:31,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 846 transitions. [2021-06-05 14:46:31,830 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 846 transitions. Word has length 18 [2021-06-05 14:46:31,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:31,830 INFO L482 AbstractCegarLoop]: Abstraction has 287 states and 846 transitions. [2021-06-05 14:46:31,830 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 14:46:31,830 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 846 transitions. [2021-06-05 14:46:31,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:31,831 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:31,831 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:32,031 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable246 [2021-06-05 14:46:32,031 INFO L430 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:32,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:32,032 INFO L82 PathProgramCache]: Analyzing trace with hash -603032005, now seen corresponding path program 37 times [2021-06-05 14:46:32,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:32,032 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398748108] [2021-06-05 14:46:32,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:32,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 14:46:32,077 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:32,077 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398748108] [2021-06-05 14:46:32,077 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398748108] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:32,077 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124690067] [2021-06-05 14:46:32,077 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 14:46:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:32,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:32,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:32,168 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 14:46:32,169 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124690067] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:32,169 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:32,169 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2021-06-05 14:46:32,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405833468] [2021-06-05 14:46:32,169 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:32,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:32,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:32,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:32,169 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 14:46:32,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:32,325 INFO L93 Difference]: Finished difference Result 610 states and 1732 transitions. [2021-06-05 14:46:32,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:32,325 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 14:46:32,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:32,326 INFO L225 Difference]: With dead ends: 610 [2021-06-05 14:46:32,326 INFO L226 Difference]: Without dead ends: 591 [2021-06-05 14:46:32,326 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 154.1ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:46:32,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2021-06-05 14:46:32,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 293. [2021-06-05 14:46:32,330 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 14:46:32,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 873 transitions. [2021-06-05 14:46:32,330 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 873 transitions. Word has length 18 [2021-06-05 14:46:32,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:32,330 INFO L482 AbstractCegarLoop]: Abstraction has 293 states and 873 transitions. [2021-06-05 14:46:32,330 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 14:46:32,330 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 873 transitions. [2021-06-05 14:46:32,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:32,331 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:32,331 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:32,531 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable250,42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:32,531 INFO L430 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:32,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:32,531 INFO L82 PathProgramCache]: Analyzing trace with hash 327129171, now seen corresponding path program 38 times [2021-06-05 14:46:32,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:32,531 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241753518] [2021-06-05 14:46:32,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:32,570 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 14:46:32,570 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:32,570 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241753518] [2021-06-05 14:46:32,570 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241753518] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:32,570 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722078854] [2021-06-05 14:46:32,570 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 14:46:32,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:32,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:32,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:32,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:32,661 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 14:46:32,662 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722078854] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:32,662 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:32,662 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:46:32,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960591284] [2021-06-05 14:46:32,662 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:46:32,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:32,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:46:32,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:32,662 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 14:46:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:32,810 INFO L93 Difference]: Finished difference Result 598 states and 1692 transitions. [2021-06-05 14:46:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:32,810 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 14:46:32,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:32,811 INFO L225 Difference]: With dead ends: 598 [2021-06-05 14:46:32,811 INFO L226 Difference]: Without dead ends: 575 [2021-06-05 14:46:32,811 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 145.9ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:32,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-06-05 14:46:32,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 295. [2021-06-05 14:46:32,815 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 14:46:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 874 transitions. [2021-06-05 14:46:32,815 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 874 transitions. Word has length 18 [2021-06-05 14:46:32,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:32,816 INFO L482 AbstractCegarLoop]: Abstraction has 295 states and 874 transitions. [2021-06-05 14:46:32,816 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 14:46:32,816 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 874 transitions. [2021-06-05 14:46:32,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:32,816 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:32,816 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:33,016 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable253,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:33,017 INFO L430 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:33,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:33,017 INFO L82 PathProgramCache]: Analyzing trace with hash -332522313, now seen corresponding path program 39 times [2021-06-05 14:46:33,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:33,017 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422208139] [2021-06-05 14:46:33,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:33,056 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 14:46:33,057 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:33,057 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422208139] [2021-06-05 14:46:33,057 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422208139] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:33,057 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022178336] [2021-06-05 14:46:33,057 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 14:46:33,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:46:33,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:33,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:33,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:33,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 14:46:33,171 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022178336] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:33,171 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:33,171 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 14:46:33,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821234694] [2021-06-05 14:46:33,171 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:46:33,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:33,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:46:33,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:33,172 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 14:46:33,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:33,331 INFO L93 Difference]: Finished difference Result 653 states and 1829 transitions. [2021-06-05 14:46:33,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:33,331 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 14:46:33,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:33,332 INFO L225 Difference]: With dead ends: 653 [2021-06-05 14:46:33,332 INFO L226 Difference]: Without dead ends: 634 [2021-06-05 14:46:33,332 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 168.7ms TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:46:33,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2021-06-05 14:46:33,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 292. [2021-06-05 14:46:33,336 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 14:46:33,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 871 transitions. [2021-06-05 14:46:33,336 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 871 transitions. Word has length 18 [2021-06-05 14:46:33,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:33,336 INFO L482 AbstractCegarLoop]: Abstraction has 292 states and 871 transitions. [2021-06-05 14:46:33,336 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 14:46:33,336 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 871 transitions. [2021-06-05 14:46:33,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:33,337 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:33,337 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:33,537 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable258,44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:33,537 INFO L430 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:33,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:33,538 INFO L82 PathProgramCache]: Analyzing trace with hash -513650761, now seen corresponding path program 40 times [2021-06-05 14:46:33,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:33,538 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065293493] [2021-06-05 14:46:33,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:33,573 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 14:46:33,574 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:33,574 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065293493] [2021-06-05 14:46:33,574 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065293493] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:33,574 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500942817] [2021-06-05 14:46:33,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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-06-05 14:46:33,604 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:46:33,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:33,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:33,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:33,676 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 14:46:33,676 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500942817] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:33,676 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:33,676 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:33,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701185906] [2021-06-05 14:46:33,676 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:33,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:33,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:33,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:33,677 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 14:46:33,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:33,809 INFO L93 Difference]: Finished difference Result 634 states and 1800 transitions. [2021-06-05 14:46:33,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:33,810 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 14:46:33,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:33,810 INFO L225 Difference]: With dead ends: 634 [2021-06-05 14:46:33,810 INFO L226 Difference]: Without dead ends: 615 [2021-06-05 14:46:33,811 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 106.1ms TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:46:33,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-06-05 14:46:33,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 288. [2021-06-05 14:46:33,814 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 14:46:33,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 851 transitions. [2021-06-05 14:46:33,815 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 851 transitions. Word has length 18 [2021-06-05 14:46:33,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:33,815 INFO L482 AbstractCegarLoop]: Abstraction has 288 states and 851 transitions. [2021-06-05 14:46:33,815 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 14:46:33,815 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 851 transitions. [2021-06-05 14:46:33,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:33,815 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:33,815 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:34,015 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable262,45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:34,016 INFO L430 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:34,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:34,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1900023759, now seen corresponding path program 41 times [2021-06-05 14:46:34,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:34,016 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108887327] [2021-06-05 14:46:34,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:34,057 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 14:46:34,058 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:34,058 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108887327] [2021-06-05 14:46:34,058 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108887327] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:34,058 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370670063] [2021-06-05 14:46:34,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 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 14:46:34,082 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:34,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:34,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:34,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:34,164 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 14:46:34,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370670063] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:34,165 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:34,165 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:34,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054547684] [2021-06-05 14:46:34,165 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:34,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:34,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:34,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:34,165 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 14:46:34,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:34,359 INFO L93 Difference]: Finished difference Result 606 states and 1702 transitions. [2021-06-05 14:46:34,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:34,359 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 14:46:34,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:34,360 INFO L225 Difference]: With dead ends: 606 [2021-06-05 14:46:34,360 INFO L226 Difference]: Without dead ends: 583 [2021-06-05 14:46:34,360 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 175.2ms TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:46:34,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-06-05 14:46:34,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 296. [2021-06-05 14:46:34,364 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 14:46:34,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 873 transitions. [2021-06-05 14:46:34,364 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 873 transitions. Word has length 18 [2021-06-05 14:46:34,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:34,364 INFO L482 AbstractCegarLoop]: Abstraction has 296 states and 873 transitions. [2021-06-05 14:46:34,364 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 14:46:34,365 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 873 transitions. [2021-06-05 14:46:34,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:34,365 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:34,365 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:34,565 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable265 [2021-06-05 14:46:34,565 INFO L430 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:34,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:34,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1416386093, now seen corresponding path program 42 times [2021-06-05 14:46:34,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:34,566 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411044291] [2021-06-05 14:46:34,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:34,605 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 14:46:34,605 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:34,605 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411044291] [2021-06-05 14:46:34,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411044291] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:34,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704321930] [2021-06-05 14:46:34,606 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 14:46:34,642 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:46:34,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:34,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:34,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:34,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 14:46:34,722 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704321930] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:34,722 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:34,722 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:34,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664723244] [2021-06-05 14:46:34,722 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:34,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:34,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:34,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:34,722 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 14:46:34,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:34,907 INFO L93 Difference]: Finished difference Result 590 states and 1672 transitions. [2021-06-05 14:46:34,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:34,908 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 14:46:34,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:34,908 INFO L225 Difference]: With dead ends: 590 [2021-06-05 14:46:34,908 INFO L226 Difference]: Without dead ends: 571 [2021-06-05 14:46:34,908 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 166.7ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:46:34,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-06-05 14:46:34,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 285. [2021-06-05 14:46:34,912 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 14:46:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 838 transitions. [2021-06-05 14:46:34,912 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 838 transitions. Word has length 18 [2021-06-05 14:46:34,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:34,913 INFO L482 AbstractCegarLoop]: Abstraction has 285 states and 838 transitions. [2021-06-05 14:46:34,913 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 14:46:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 838 transitions. [2021-06-05 14:46:34,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:34,913 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:34,913 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:35,126 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable270 [2021-06-05 14:46:35,127 INFO L430 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:35,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:35,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1542604225, now seen corresponding path program 43 times [2021-06-05 14:46:35,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:35,127 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901677844] [2021-06-05 14:46:35,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:35,173 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 14:46:35,173 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:35,173 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901677844] [2021-06-05 14:46:35,173 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901677844] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:35,173 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369489969] [2021-06-05 14:46:35,173 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 14:46:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:35,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:35,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:35,265 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 14:46:35,265 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369489969] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:35,265 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:35,265 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 14:46:35,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953505524] [2021-06-05 14:46:35,266 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:46:35,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:35,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:46:35,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:35,266 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 14:46:35,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:35,469 INFO L93 Difference]: Finished difference Result 479 states and 1339 transitions. [2021-06-05 14:46:35,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:35,469 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 14:46:35,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:35,470 INFO L225 Difference]: With dead ends: 479 [2021-06-05 14:46:35,470 INFO L226 Difference]: Without dead ends: 460 [2021-06-05 14:46:35,470 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 211.2ms TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:46:35,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-06-05 14:46:35,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 289. [2021-06-05 14:46:35,473 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 14:46:35,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 848 transitions. [2021-06-05 14:46:35,473 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 848 transitions. Word has length 18 [2021-06-05 14:46:35,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:35,474 INFO L482 AbstractCegarLoop]: Abstraction has 289 states and 848 transitions. [2021-06-05 14:46:35,474 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 14:46:35,474 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 848 transitions. [2021-06-05 14:46:35,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:35,474 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:35,474 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:35,674 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable273,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:35,674 INFO L430 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:35,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:35,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1745377557, now seen corresponding path program 44 times [2021-06-05 14:46:35,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:35,675 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703044411] [2021-06-05 14:46:35,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:35,717 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 14:46:35,717 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:35,717 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703044411] [2021-06-05 14:46:35,717 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703044411] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:35,717 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622153442] [2021-06-05 14:46:35,717 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 14:46:35,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:35,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:35,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:35,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:35,827 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 14:46:35,827 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622153442] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:35,827 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:35,827 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:35,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884727460] [2021-06-05 14:46:35,827 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:35,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:35,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:35,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:35,827 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 14:46:36,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:36,039 INFO L93 Difference]: Finished difference Result 485 states and 1345 transitions. [2021-06-05 14:46:36,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:36,039 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 14:46:36,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:36,040 INFO L225 Difference]: With dead ends: 485 [2021-06-05 14:46:36,040 INFO L226 Difference]: Without dead ends: 462 [2021-06-05 14:46:36,040 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 225.3ms TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:46:36,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2021-06-05 14:46:36,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 297. [2021-06-05 14:46:36,043 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 14:46:36,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 870 transitions. [2021-06-05 14:46:36,044 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 870 transitions. Word has length 18 [2021-06-05 14:46:36,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:36,044 INFO L482 AbstractCegarLoop]: Abstraction has 297 states and 870 transitions. [2021-06-05 14:46:36,044 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 14:46:36,044 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 870 transitions. [2021-06-05 14:46:36,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:36,044 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:36,044 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:36,244 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable276 [2021-06-05 14:46:36,245 INFO L430 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:36,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:36,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1334230119, now seen corresponding path program 45 times [2021-06-05 14:46:36,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:36,245 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211726326] [2021-06-05 14:46:36,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:36,288 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 14:46:36,288 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:36,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211726326] [2021-06-05 14:46:36,288 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211726326] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:36,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211500996] [2021-06-05 14:46:36,288 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 14:46:36,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:46:36,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:36,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:36,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:36,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 14:46:36,389 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211500996] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:36,389 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:36,389 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:36,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332212091] [2021-06-05 14:46:36,390 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:36,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:36,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:36,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:36,390 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 14:46:36,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:36,602 INFO L93 Difference]: Finished difference Result 469 states and 1315 transitions. [2021-06-05 14:46:36,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:36,602 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 14:46:36,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:36,603 INFO L225 Difference]: With dead ends: 469 [2021-06-05 14:46:36,603 INFO L226 Difference]: Without dead ends: 450 [2021-06-05 14:46:36,603 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 214.9ms TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:46:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-06-05 14:46:36,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 285. [2021-06-05 14:46:36,606 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 14:46:36,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 838 transitions. [2021-06-05 14:46:36,606 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 838 transitions. Word has length 18 [2021-06-05 14:46:36,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:36,607 INFO L482 AbstractCegarLoop]: Abstraction has 285 states and 838 transitions. [2021-06-05 14:46:36,607 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 14:46:36,607 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 838 transitions. [2021-06-05 14:46:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:36,607 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:36,607 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:36,807 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable281 [2021-06-05 14:46:36,807 INFO L430 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:36,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:36,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1633409787, now seen corresponding path program 46 times [2021-06-05 14:46:36,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:36,808 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064957385] [2021-06-05 14:46:36,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:36,857 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 14:46:36,857 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:36,857 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064957385] [2021-06-05 14:46:36,857 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064957385] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:36,858 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595547662] [2021-06-05 14:46:36,858 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 14:46:36,882 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:46:36,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:36,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:36,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:36,975 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 14:46:36,975 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595547662] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:36,975 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:36,975 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:46:36,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683749098] [2021-06-05 14:46:36,975 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:46:36,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:36,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:46:36,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:36,976 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 14:46:37,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:37,175 INFO L93 Difference]: Finished difference Result 433 states and 1220 transitions. [2021-06-05 14:46:37,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:37,175 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 14:46:37,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:37,175 INFO L225 Difference]: With dead ends: 433 [2021-06-05 14:46:37,175 INFO L226 Difference]: Without dead ends: 406 [2021-06-05 14:46:37,176 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 220.0ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:37,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-06-05 14:46:37,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 287. [2021-06-05 14:46:37,178 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 14:46:37,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 843 transitions. [2021-06-05 14:46:37,179 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 843 transitions. Word has length 18 [2021-06-05 14:46:37,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:37,179 INFO L482 AbstractCegarLoop]: Abstraction has 287 states and 843 transitions. [2021-06-05 14:46:37,179 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 14:46:37,179 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 843 transitions. [2021-06-05 14:46:37,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:37,179 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:37,179 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:37,380 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable284,51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:37,380 INFO L430 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:37,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:37,380 INFO L82 PathProgramCache]: Analyzing trace with hash 44908247, now seen corresponding path program 6 times [2021-06-05 14:46:37,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:37,380 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453025850] [2021-06-05 14:46:37,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:37,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 14:46:37,416 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:37,416 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453025850] [2021-06-05 14:46:37,416 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453025850] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:37,416 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764435686] [2021-06-05 14:46:37,416 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 14:46:37,441 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:46:37,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:37,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:46:37,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:37,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 14:46:37,499 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764435686] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:37,499 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:37,499 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:37,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675149096] [2021-06-05 14:46:37,500 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:37,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:37,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:37,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:37,500 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 14:46:37,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:37,642 INFO L93 Difference]: Finished difference Result 476 states and 1332 transitions. [2021-06-05 14:46:37,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:37,642 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 14:46:37,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:37,643 INFO L225 Difference]: With dead ends: 476 [2021-06-05 14:46:37,643 INFO L226 Difference]: Without dead ends: 454 [2021-06-05 14:46:37,643 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 119.2ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:46:37,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-06-05 14:46:37,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 289. [2021-06-05 14:46:37,646 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 14:46:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 850 transitions. [2021-06-05 14:46:37,646 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 850 transitions. Word has length 18 [2021-06-05 14:46:37,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:37,647 INFO L482 AbstractCegarLoop]: Abstraction has 289 states and 850 transitions. [2021-06-05 14:46:37,647 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 14:46:37,647 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 850 transitions. [2021-06-05 14:46:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:37,647 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:37,647 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:37,847 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable289 [2021-06-05 14:46:37,847 INFO L430 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:37,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:37,848 INFO L82 PathProgramCache]: Analyzing trace with hash -675858551, now seen corresponding path program 47 times [2021-06-05 14:46:37,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:37,848 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384060688] [2021-06-05 14:46:37,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:37,890 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 14:46:37,890 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:37,890 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384060688] [2021-06-05 14:46:37,890 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384060688] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:37,890 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843256550] [2021-06-05 14:46:37,890 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 14:46:37,915 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:37,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:37,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:37,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:37,987 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 14:46:37,987 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843256550] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:37,987 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:37,987 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:37,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405889765] [2021-06-05 14:46:37,988 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:37,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:37,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:37,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:37,988 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 14:46:38,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:38,195 INFO L93 Difference]: Finished difference Result 434 states and 1224 transitions. [2021-06-05 14:46:38,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:38,195 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 14:46:38,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:38,196 INFO L225 Difference]: With dead ends: 434 [2021-06-05 14:46:38,196 INFO L226 Difference]: Without dead ends: 411 [2021-06-05 14:46:38,196 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 218.9ms TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:46:38,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2021-06-05 14:46:38,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 297. [2021-06-05 14:46:38,199 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 14:46:38,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 874 transitions. [2021-06-05 14:46:38,199 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 874 transitions. Word has length 18 [2021-06-05 14:46:38,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:38,199 INFO L482 AbstractCegarLoop]: Abstraction has 297 states and 874 transitions. [2021-06-05 14:46:38,199 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 14:46:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 874 transitions. [2021-06-05 14:46:38,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:38,200 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:38,200 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:38,415 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable292,53 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:38,415 INFO L430 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:38,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:38,416 INFO L82 PathProgramCache]: Analyzing trace with hash 438614075, now seen corresponding path program 7 times [2021-06-05 14:46:38,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:38,416 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605159286] [2021-06-05 14:46:38,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:38,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 14:46:38,447 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:38,447 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605159286] [2021-06-05 14:46:38,447 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605159286] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:38,447 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932684063] [2021-06-05 14:46:38,447 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 14:46:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:38,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:46:38,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:38,533 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 14:46:38,533 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932684063] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:38,534 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:38,534 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:38,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92207573] [2021-06-05 14:46:38,534 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:38,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:38,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:38,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:38,534 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 14:46:38,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:38,643 INFO L93 Difference]: Finished difference Result 491 states and 1363 transitions. [2021-06-05 14:46:38,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:38,643 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 14:46:38,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:38,643 INFO L225 Difference]: With dead ends: 491 [2021-06-05 14:46:38,644 INFO L226 Difference]: Without dead ends: 469 [2021-06-05 14:46:38,644 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 109.4ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:46:38,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2021-06-05 14:46:38,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 297. [2021-06-05 14:46:38,647 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 14:46:38,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 874 transitions. [2021-06-05 14:46:38,647 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 874 transitions. Word has length 18 [2021-06-05 14:46:38,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:38,648 INFO L482 AbstractCegarLoop]: Abstraction has 297 states and 874 transitions. [2021-06-05 14:46:38,648 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 14:46:38,648 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 874 transitions. [2021-06-05 14:46:38,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:38,648 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:38,648 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:38,848 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable297 [2021-06-05 14:46:38,848 INFO L430 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:38,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:38,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1891218171, now seen corresponding path program 48 times [2021-06-05 14:46:38,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:38,849 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974783598] [2021-06-05 14:46:38,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:38,903 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 14:46:38,903 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:38,903 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974783598] [2021-06-05 14:46:38,903 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974783598] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:38,904 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086085816] [2021-06-05 14:46:38,904 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 14:46:38,936 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:46:38,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:38,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:38,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:39,003 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 14:46:39,003 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086085816] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:39,003 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:39,003 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:39,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623244259] [2021-06-05 14:46:39,003 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:39,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:39,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:39,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:39,004 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 14:46:39,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:39,205 INFO L93 Difference]: Finished difference Result 409 states and 1172 transitions. [2021-06-05 14:46:39,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:39,208 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 14:46:39,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:39,209 INFO L225 Difference]: With dead ends: 409 [2021-06-05 14:46:39,209 INFO L226 Difference]: Without dead ends: 390 [2021-06-05 14:46:39,209 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 208.4ms TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:46:39,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-06-05 14:46:39,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 291. [2021-06-05 14:46:39,212 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 14:46:39,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 857 transitions. [2021-06-05 14:46:39,212 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 857 transitions. Word has length 18 [2021-06-05 14:46:39,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:39,212 INFO L482 AbstractCegarLoop]: Abstraction has 291 states and 857 transitions. [2021-06-05 14:46:39,213 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 14:46:39,213 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 857 transitions. [2021-06-05 14:46:39,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:39,213 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:39,213 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:39,413 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable300 [2021-06-05 14:46:39,413 INFO L430 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:39,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:39,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1494230001, now seen corresponding path program 8 times [2021-06-05 14:46:39,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:39,414 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299777512] [2021-06-05 14:46:39,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:39,449 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 14:46:39,449 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:39,449 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299777512] [2021-06-05 14:46:39,449 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299777512] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:39,449 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:39,449 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 14:46:39,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063374142] [2021-06-05 14:46:39,449 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:39,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:39,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:39,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:39,450 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 14:46:39,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:39,540 INFO L93 Difference]: Finished difference Result 449 states and 1262 transitions. [2021-06-05 14:46:39,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:39,540 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 14:46:39,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:39,540 INFO L225 Difference]: With dead ends: 449 [2021-06-05 14:46:39,540 INFO L226 Difference]: Without dead ends: 420 [2021-06-05 14:46:39,541 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 77.4ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:39,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2021-06-05 14:46:39,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 289. [2021-06-05 14:46:39,544 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 14:46:39,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 850 transitions. [2021-06-05 14:46:39,544 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 850 transitions. Word has length 18 [2021-06-05 14:46:39,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:39,544 INFO L482 AbstractCegarLoop]: Abstraction has 289 states and 850 transitions. [2021-06-05 14:46:39,544 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 14:46:39,544 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 850 transitions. [2021-06-05 14:46:39,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:39,545 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:39,545 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:39,545 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable303 [2021-06-05 14:46:39,545 INFO L430 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:39,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:39,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1770591994, now seen corresponding path program 6 times [2021-06-05 14:46:39,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:39,545 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701149611] [2021-06-05 14:46:39,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:39,571 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 14:46:39,571 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:39,571 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701149611] [2021-06-05 14:46:39,571 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701149611] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:39,571 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960190297] [2021-06-05 14:46:39,571 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 14:46:39,598 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:46:39,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:39,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:46:39,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:39,657 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 14:46:39,658 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960190297] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:39,658 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:39,658 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2021-06-05 14:46:39,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621867360] [2021-06-05 14:46:39,658 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:39,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:39,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:39,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:39,658 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 14:46:39,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:39,754 INFO L93 Difference]: Finished difference Result 435 states and 1232 transitions. [2021-06-05 14:46:39,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:46:39,754 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 14:46:39,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:39,754 INFO L225 Difference]: With dead ends: 435 [2021-06-05 14:46:39,754 INFO L226 Difference]: Without dead ends: 347 [2021-06-05 14:46:39,754 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 99.5ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:39,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-06-05 14:46:39,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 255. [2021-06-05 14:46:39,757 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 14:46:39,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 757 transitions. [2021-06-05 14:46:39,757 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 757 transitions. Word has length 18 [2021-06-05 14:46:39,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:39,757 INFO L482 AbstractCegarLoop]: Abstraction has 255 states and 757 transitions. [2021-06-05 14:46:39,758 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 14:46:39,758 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 757 transitions. [2021-06-05 14:46:39,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:39,758 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:39,758 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:39,958 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable304,56 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:39,958 INFO L430 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:39,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:39,959 INFO L82 PathProgramCache]: Analyzing trace with hash 698798277, now seen corresponding path program 49 times [2021-06-05 14:46:39,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:39,959 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353512923] [2021-06-05 14:46:39,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:40,011 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 14:46:40,011 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:40,011 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353512923] [2021-06-05 14:46:40,011 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353512923] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:40,011 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373814973] [2021-06-05 14:46:40,011 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 14:46:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:40,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:40,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:40,099 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 14:46:40,100 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373814973] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:40,100 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:40,100 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2021-06-05 14:46:40,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751463265] [2021-06-05 14:46:40,100 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:40,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:40,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:40,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:40,100 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 14:46:40,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:40,294 INFO L93 Difference]: Finished difference Result 457 states and 1299 transitions. [2021-06-05 14:46:40,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:40,294 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 14:46:40,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:40,295 INFO L225 Difference]: With dead ends: 457 [2021-06-05 14:46:40,295 INFO L226 Difference]: Without dead ends: 438 [2021-06-05 14:46:40,295 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 203.5ms TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:40,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-06-05 14:46:40,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 260. [2021-06-05 14:46:40,298 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 14:46:40,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 776 transitions. [2021-06-05 14:46:40,298 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 776 transitions. Word has length 18 [2021-06-05 14:46:40,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:40,298 INFO L482 AbstractCegarLoop]: Abstraction has 260 states and 776 transitions. [2021-06-05 14:46:40,299 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 14:46:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 776 transitions. [2021-06-05 14:46:40,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:40,299 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:40,299 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:40,500 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable308,57 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:40,501 INFO L430 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:40,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:40,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1628959453, now seen corresponding path program 50 times [2021-06-05 14:46:40,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:40,501 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384572000] [2021-06-05 14:46:40,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:40,540 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 14:46:40,541 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:40,541 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384572000] [2021-06-05 14:46:40,541 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384572000] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:40,541 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435121994] [2021-06-05 14:46:40,541 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 14:46:40,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:40,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:40,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:40,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:40,632 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 14:46:40,632 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435121994] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:40,632 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:40,632 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:46:40,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792076501] [2021-06-05 14:46:40,632 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:46:40,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:40,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:46:40,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:40,633 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 14:46:40,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:40,839 INFO L93 Difference]: Finished difference Result 461 states and 1299 transitions. [2021-06-05 14:46:40,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:40,839 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 14:46:40,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:40,839 INFO L225 Difference]: With dead ends: 461 [2021-06-05 14:46:40,839 INFO L226 Difference]: Without dead ends: 438 [2021-06-05 14:46:40,840 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 193.8ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:46:40,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-06-05 14:46:40,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 258. [2021-06-05 14:46:40,842 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 14:46:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 769 transitions. [2021-06-05 14:46:40,843 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 769 transitions. Word has length 18 [2021-06-05 14:46:40,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:40,843 INFO L482 AbstractCegarLoop]: Abstraction has 258 states and 769 transitions. [2021-06-05 14:46:40,843 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 14:46:40,843 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 769 transitions. [2021-06-05 14:46:40,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:40,843 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:40,843 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:41,044 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable311,58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:41,044 INFO L430 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:41,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:41,044 INFO L82 PathProgramCache]: Analyzing trace with hash 616266921, now seen corresponding path program 51 times [2021-06-05 14:46:41,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:41,044 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951826931] [2021-06-05 14:46:41,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:41,085 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 14:46:41,085 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:41,085 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951826931] [2021-06-05 14:46:41,085 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951826931] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:41,085 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075627508] [2021-06-05 14:46:41,085 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 14:46:41,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:46:41,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:41,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:41,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:41,182 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 14:46:41,182 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075627508] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:41,182 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:41,182 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 14:46:41,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448069454] [2021-06-05 14:46:41,182 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:46:41,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:41,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:46:41,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:46:41,182 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 14:46:41,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:41,377 INFO L93 Difference]: Finished difference Result 455 states and 1280 transitions. [2021-06-05 14:46:41,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:41,377 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 14:46:41,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:41,378 INFO L225 Difference]: With dead ends: 455 [2021-06-05 14:46:41,378 INFO L226 Difference]: Without dead ends: 428 [2021-06-05 14:46:41,378 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 181.0ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:41,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-06-05 14:46:41,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 258. [2021-06-05 14:46:41,381 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 14:46:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 767 transitions. [2021-06-05 14:46:41,381 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 767 transitions. Word has length 18 [2021-06-05 14:46:41,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:41,381 INFO L482 AbstractCegarLoop]: Abstraction has 258 states and 767 transitions. [2021-06-05 14:46:41,381 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 14:46:41,381 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 767 transitions. [2021-06-05 14:46:41,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:41,381 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:41,381 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:41,582 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable316 [2021-06-05 14:46:41,582 INFO L430 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:41,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:41,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1345274345, now seen corresponding path program 9 times [2021-06-05 14:46:41,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:41,582 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256004570] [2021-06-05 14:46:41,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:41,598 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 14:46:41,598 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:41,598 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256004570] [2021-06-05 14:46:41,598 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256004570] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:41,598 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352133796] [2021-06-05 14:46:41,598 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 14:46:41,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:46:41,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:41,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:46:41,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:41,659 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 14:46:41,659 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352133796] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:41,659 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:41,659 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-06-05 14:46:41,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653567712] [2021-06-05 14:46:41,659 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:46:41,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:41,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:46:41,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:46:41,659 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 14:46:41,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:41,702 INFO L93 Difference]: Finished difference Result 393 states and 1148 transitions. [2021-06-05 14:46:41,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:46:41,702 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 14:46:41,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:41,703 INFO L225 Difference]: With dead ends: 393 [2021-06-05 14:46:41,703 INFO L226 Difference]: Without dead ends: 353 [2021-06-05 14:46:41,703 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 35.7ms TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:41,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-06-05 14:46:41,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 247. [2021-06-05 14:46:41,705 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 14:46:41,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 735 transitions. [2021-06-05 14:46:41,706 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 735 transitions. Word has length 18 [2021-06-05 14:46:41,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:41,706 INFO L482 AbstractCegarLoop]: Abstraction has 247 states and 735 transitions. [2021-06-05 14:46:41,706 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 14:46:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 735 transitions. [2021-06-05 14:46:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:41,706 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:41,706 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:41,906 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable321 [2021-06-05 14:46:41,907 INFO L430 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:41,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:41,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1782534729, now seen corresponding path program 52 times [2021-06-05 14:46:41,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:41,907 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335442705] [2021-06-05 14:46:41,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:41,951 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 14:46:41,951 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:41,951 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335442705] [2021-06-05 14:46:41,951 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335442705] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:41,951 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122342370] [2021-06-05 14:46:41,951 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 14:46:41,975 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:46:41,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:41,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:41,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:42,031 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 14:46:42,032 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122342370] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:42,032 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:42,032 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2021-06-05 14:46:42,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463370196] [2021-06-05 14:46:42,032 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:42,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:42,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:42,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:42,032 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 14:46:42,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:42,176 INFO L93 Difference]: Finished difference Result 487 states and 1353 transitions. [2021-06-05 14:46:42,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:42,177 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 14:46:42,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:42,177 INFO L225 Difference]: With dead ends: 487 [2021-06-05 14:46:42,177 INFO L226 Difference]: Without dead ends: 468 [2021-06-05 14:46:42,178 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 141.8ms TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:46:42,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-06-05 14:46:42,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 253. [2021-06-05 14:46:42,180 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 14:46:42,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 763 transitions. [2021-06-05 14:46:42,181 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 763 transitions. Word has length 18 [2021-06-05 14:46:42,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:42,181 INFO L482 AbstractCegarLoop]: Abstraction has 253 states and 763 transitions. [2021-06-05 14:46:42,181 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 14:46:42,181 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 763 transitions. [2021-06-05 14:46:42,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:42,181 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:42,181 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:42,382 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable325 [2021-06-05 14:46:42,382 INFO L430 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:42,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:42,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1582271391, now seen corresponding path program 53 times [2021-06-05 14:46:42,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:42,382 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813280788] [2021-06-05 14:46:42,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:42,436 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 14:46:42,436 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:42,436 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813280788] [2021-06-05 14:46:42,436 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813280788] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:42,436 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627663533] [2021-06-05 14:46:42,436 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 14:46:42,462 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:42,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:42,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:42,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:42,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 14:46:42,534 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627663533] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:42,534 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:42,534 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:46:42,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989435440] [2021-06-05 14:46:42,534 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:46:42,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:42,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:46:42,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:42,535 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 14:46:42,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:42,710 INFO L93 Difference]: Finished difference Result 491 states and 1353 transitions. [2021-06-05 14:46:42,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:42,710 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 14:46:42,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:42,711 INFO L225 Difference]: With dead ends: 491 [2021-06-05 14:46:42,711 INFO L226 Difference]: Without dead ends: 468 [2021-06-05 14:46:42,711 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 154.4ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:42,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-06-05 14:46:42,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 255. [2021-06-05 14:46:42,714 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 14:46:42,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 764 transitions. [2021-06-05 14:46:42,715 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 764 transitions. Word has length 18 [2021-06-05 14:46:42,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:42,715 INFO L482 AbstractCegarLoop]: Abstraction has 255 states and 764 transitions. [2021-06-05 14:46:42,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 14:46:42,715 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 764 transitions. [2021-06-05 14:46:42,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:42,715 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:42,715 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:42,924 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable328,62 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:42,925 INFO L430 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:42,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:42,925 INFO L82 PathProgramCache]: Analyzing trace with hash -951095685, now seen corresponding path program 10 times [2021-06-05 14:46:42,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:42,925 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598691288] [2021-06-05 14:46:42,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:42,944 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 14:46:42,945 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:42,945 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598691288] [2021-06-05 14:46:42,945 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598691288] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:42,945 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981866001] [2021-06-05 14:46:42,945 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 14:46:42,968 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:46:42,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:42,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:46:42,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:43,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 14:46:43,007 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981866001] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:43,007 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:43,007 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-06-05 14:46:43,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315604156] [2021-06-05 14:46:43,007 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:46:43,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:43,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:46:43,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:46:43,007 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 14:46:43,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:43,049 INFO L93 Difference]: Finished difference Result 360 states and 1024 transitions. [2021-06-05 14:46:43,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:46:43,049 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 14:46:43,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:43,049 INFO L225 Difference]: With dead ends: 360 [2021-06-05 14:46:43,049 INFO L226 Difference]: Without dead ends: 320 [2021-06-05 14:46:43,049 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 38.9ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:43,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-06-05 14:46:43,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 249. [2021-06-05 14:46:43,052 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 14:46:43,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 737 transitions. [2021-06-05 14:46:43,052 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 737 transitions. Word has length 18 [2021-06-05 14:46:43,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:43,052 INFO L482 AbstractCegarLoop]: Abstraction has 249 states and 737 transitions. [2021-06-05 14:46:43,052 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 14:46:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 737 transitions. [2021-06-05 14:46:43,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:43,053 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:43,053 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:43,253 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable333 [2021-06-05 14:46:43,253 INFO L430 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:43,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:43,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2053044421, now seen corresponding path program 54 times [2021-06-05 14:46:43,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:43,253 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996456177] [2021-06-05 14:46:43,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:43,301 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 14:46:43,301 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:43,301 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996456177] [2021-06-05 14:46:43,301 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996456177] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:43,301 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819871031] [2021-06-05 14:46:43,301 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 14:46:43,325 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:46:43,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:43,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:43,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:43,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 14:46:43,428 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819871031] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:43,428 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:43,428 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 14:46:43,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497636350] [2021-06-05 14:46:43,429 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:46:43,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:43,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:46:43,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:43,429 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 14:46:43,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:43,612 INFO L93 Difference]: Finished difference Result 461 states and 1276 transitions. [2021-06-05 14:46:43,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:43,612 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 14:46:43,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:43,612 INFO L225 Difference]: With dead ends: 461 [2021-06-05 14:46:43,613 INFO L226 Difference]: Without dead ends: 442 [2021-06-05 14:46:43,613 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 193.5ms TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:46:43,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2021-06-05 14:46:43,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 246. [2021-06-05 14:46:43,615 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 14:46:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 734 transitions. [2021-06-05 14:46:43,616 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 734 transitions. Word has length 18 [2021-06-05 14:46:43,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:43,616 INFO L482 AbstractCegarLoop]: Abstraction has 246 states and 734 transitions. [2021-06-05 14:46:43,616 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 14:46:43,616 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 734 transitions. [2021-06-05 14:46:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:43,616 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:43,616 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:43,817 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable337,64 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:43,817 INFO L430 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:43,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:43,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1871915973, now seen corresponding path program 55 times [2021-06-05 14:46:43,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:43,817 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377522193] [2021-06-05 14:46:43,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:43,864 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 14:46:43,864 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:43,864 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377522193] [2021-06-05 14:46:43,864 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377522193] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:43,864 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115161752] [2021-06-05 14:46:43,864 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 14:46:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:43,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:43,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:43,950 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 14:46:43,951 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115161752] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:43,951 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:43,951 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:46:43,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037507028] [2021-06-05 14:46:43,951 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:46:43,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:43,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:46:43,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:43,951 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 14:46:44,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:44,052 INFO L93 Difference]: Finished difference Result 433 states and 1225 transitions. [2021-06-05 14:46:44,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:44,052 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 14:46:44,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:44,053 INFO L225 Difference]: With dead ends: 433 [2021-06-05 14:46:44,053 INFO L226 Difference]: Without dead ends: 414 [2021-06-05 14:46:44,053 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 96.6ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:44,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-06-05 14:46:44,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 242. [2021-06-05 14:46:44,056 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 14:46:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 714 transitions. [2021-06-05 14:46:44,056 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 714 transitions. Word has length 18 [2021-06-05 14:46:44,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:44,056 INFO L482 AbstractCegarLoop]: Abstraction has 242 states and 714 transitions. [2021-06-05 14:46:44,056 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 14:46:44,056 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 714 transitions. [2021-06-05 14:46:44,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:44,056 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:44,056 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:44,272 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable341,65 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:44,272 INFO L430 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:44,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:44,272 INFO L82 PathProgramCache]: Analyzing trace with hash -116472655, now seen corresponding path program 11 times [2021-06-05 14:46:44,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:44,273 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045050619] [2021-06-05 14:46:44,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:44,307 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 14:46:44,308 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:44,308 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045050619] [2021-06-05 14:46:44,308 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045050619] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:46:44,308 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:46:44,308 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:46:44,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047514615] [2021-06-05 14:46:44,308 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:46:44,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:44,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:46:44,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:46:44,308 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 14:46:44,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:44,364 INFO L93 Difference]: Finished difference Result 287 states and 821 transitions. [2021-06-05 14:46:44,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 14:46:44,365 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 14:46:44,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:44,365 INFO L225 Difference]: With dead ends: 287 [2021-06-05 14:46:44,365 INFO L226 Difference]: Without dead ends: 234 [2021-06-05 14:46:44,365 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 48.5ms TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:46:44,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-06-05 14:46:44,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 210. [2021-06-05 14:46:44,367 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 14:46:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 613 transitions. [2021-06-05 14:46:44,367 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 613 transitions. Word has length 18 [2021-06-05 14:46:44,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:44,367 INFO L482 AbstractCegarLoop]: Abstraction has 210 states and 613 transitions. [2021-06-05 14:46:44,367 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 14:46:44,367 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 613 transitions. [2021-06-05 14:46:44,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:44,368 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:44,368 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:44,368 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable344 [2021-06-05 14:46:44,368 INFO L430 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:44,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:44,368 INFO L82 PathProgramCache]: Analyzing trace with hash -9376803, now seen corresponding path program 56 times [2021-06-05 14:46:44,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:44,368 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064066345] [2021-06-05 14:46:44,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:44,415 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 14:46:44,416 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:44,416 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064066345] [2021-06-05 14:46:44,416 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064066345] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:44,416 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082597409] [2021-06-05 14:46:44,416 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 14:46:44,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:44,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:44,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:44,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:44,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 14:46:44,530 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082597409] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:44,530 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:44,530 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-06-05 14:46:44,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183328667] [2021-06-05 14:46:44,530 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:46:44,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:44,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:46:44,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:44,531 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 14:46:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:44,746 INFO L93 Difference]: Finished difference Result 427 states and 1174 transitions. [2021-06-05 14:46:44,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:44,747 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 14:46:44,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:44,747 INFO L225 Difference]: With dead ends: 427 [2021-06-05 14:46:44,747 INFO L226 Difference]: Without dead ends: 404 [2021-06-05 14:46:44,747 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 213.8ms TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:46:44,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-06-05 14:46:44,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 218. [2021-06-05 14:46:44,750 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 14:46:44,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 635 transitions. [2021-06-05 14:46:44,750 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 635 transitions. Word has length 18 [2021-06-05 14:46:44,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:44,750 INFO L482 AbstractCegarLoop]: Abstraction has 218 states and 635 transitions. [2021-06-05 14:46:44,750 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 14:46:44,751 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 635 transitions. [2021-06-05 14:46:44,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:44,751 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:44,751 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:44,951 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable345 [2021-06-05 14:46:44,951 INFO L430 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:44,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:44,951 INFO L82 PathProgramCache]: Analyzing trace with hash 969180641, now seen corresponding path program 57 times [2021-06-05 14:46:44,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:44,952 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104773418] [2021-06-05 14:46:44,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:44,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 14:46:44,990 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:44,990 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104773418] [2021-06-05 14:46:44,990 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104773418] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:44,991 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012786469] [2021-06-05 14:46:44,991 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 14:46:45,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:46:45,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:45,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:45,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:45,079 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 14:46:45,079 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012786469] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:45,079 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:45,079 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:46:45,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979133246] [2021-06-05 14:46:45,080 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:46:45,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:45,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:46:45,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:45,080 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 14:46:45,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:45,239 INFO L93 Difference]: Finished difference Result 411 states and 1144 transitions. [2021-06-05 14:46:45,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:45,239 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 14:46:45,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:45,239 INFO L225 Difference]: With dead ends: 411 [2021-06-05 14:46:45,239 INFO L226 Difference]: Without dead ends: 392 [2021-06-05 14:46:45,240 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 142.1ms TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:45,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-06-05 14:46:45,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 209. [2021-06-05 14:46:45,242 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 14:46:45,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 608 transitions. [2021-06-05 14:46:45,242 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 608 transitions. Word has length 18 [2021-06-05 14:46:45,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:45,243 INFO L482 AbstractCegarLoop]: Abstraction has 209 states and 608 transitions. [2021-06-05 14:46:45,243 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 14:46:45,243 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 608 transitions. [2021-06-05 14:46:45,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:45,243 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:45,243 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:45,443 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable350,67 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:45,443 INFO L430 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:45,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:45,444 INFO L82 PathProgramCache]: Analyzing trace with hash 2131358893, now seen corresponding path program 58 times [2021-06-05 14:46:45,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:45,444 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465627357] [2021-06-05 14:46:45,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:45,489 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 14:46:45,489 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:45,489 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465627357] [2021-06-05 14:46:45,489 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465627357] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:45,489 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555214664] [2021-06-05 14:46:45,489 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 14:46:45,513 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:46:45,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:45,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:45,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:45,571 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 14:46:45,571 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555214664] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:45,571 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:45,571 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 14:46:45,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605139117] [2021-06-05 14:46:45,571 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:46:45,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:45,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:46:45,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:46:45,572 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 14:46:45,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:45,752 INFO L93 Difference]: Finished difference Result 371 states and 1026 transitions. [2021-06-05 14:46:45,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:45,753 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 14:46:45,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:45,753 INFO L225 Difference]: With dead ends: 371 [2021-06-05 14:46:45,753 INFO L226 Difference]: Without dead ends: 344 [2021-06-05 14:46:45,753 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 172.6ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:45,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-06-05 14:46:45,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 211. [2021-06-05 14:46:45,756 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 14:46:45,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 613 transitions. [2021-06-05 14:46:45,756 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 613 transitions. Word has length 18 [2021-06-05 14:46:45,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:45,756 INFO L482 AbstractCegarLoop]: Abstraction has 211 states and 613 transitions. [2021-06-05 14:46:45,756 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 14:46:45,756 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 613 transitions. [2021-06-05 14:46:45,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:45,756 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:45,756 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:45,957 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable353,68 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:45,957 INFO L430 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:45,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:45,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1750676137, now seen corresponding path program 59 times [2021-06-05 14:46:45,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:45,957 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220585673] [2021-06-05 14:46:45,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:45,998 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 14:46:45,998 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:45,998 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220585673] [2021-06-05 14:46:45,998 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220585673] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:45,998 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843891422] [2021-06-05 14:46:45,998 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 14:46:46,022 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:46,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:46,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:46,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:46,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 14:46:46,089 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843891422] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:46,089 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:46,089 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:46:46,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212260692] [2021-06-05 14:46:46,089 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:46:46,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:46,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:46:46,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:46,090 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 14:46:46,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:46,280 INFO L93 Difference]: Finished difference Result 363 states and 1008 transitions. [2021-06-05 14:46:46,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:46,280 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 14:46:46,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:46,281 INFO L225 Difference]: With dead ends: 363 [2021-06-05 14:46:46,281 INFO L226 Difference]: Without dead ends: 340 [2021-06-05 14:46:46,281 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 186.0ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:46:46,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-06-05 14:46:46,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 219. [2021-06-05 14:46:46,283 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 14:46:46,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 635 transitions. [2021-06-05 14:46:46,284 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 635 transitions. Word has length 18 [2021-06-05 14:46:46,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:46,284 INFO L482 AbstractCegarLoop]: Abstraction has 219 states and 635 transitions. [2021-06-05 14:46:46,284 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 14:46:46,284 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 635 transitions. [2021-06-05 14:46:46,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:46,284 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:46,284 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:46,491 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable358 [2021-06-05 14:46:46,491 INFO L430 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:46,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:46,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1565733715, now seen corresponding path program 60 times [2021-06-05 14:46:46,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:46,492 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198657872] [2021-06-05 14:46:46,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:46,540 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 14:46:46,540 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:46,540 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198657872] [2021-06-05 14:46:46,541 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198657872] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:46,541 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174843946] [2021-06-05 14:46:46,541 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 14:46:46,566 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:46:46,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:46,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:46,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:46,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 14:46:46,638 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174843946] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:46,638 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:46,638 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:46:46,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616881337] [2021-06-05 14:46:46,638 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:46:46,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:46,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:46:46,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:46,638 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 14:46:46,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:46,817 INFO L93 Difference]: Finished difference Result 338 states and 956 transitions. [2021-06-05 14:46:46,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:46,817 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 14:46:46,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:46,818 INFO L225 Difference]: With dead ends: 338 [2021-06-05 14:46:46,818 INFO L226 Difference]: Without dead ends: 319 [2021-06-05 14:46:46,818 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 180.7ms TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:46:46,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-06-05 14:46:46,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 209. [2021-06-05 14:46:46,820 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 14:46:46,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 608 transitions. [2021-06-05 14:46:46,820 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 608 transitions. Word has length 18 [2021-06-05 14:46:46,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:46,821 INFO L482 AbstractCegarLoop]: Abstraction has 209 states and 608 transitions. [2021-06-05 14:46:46,821 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 14:46:46,821 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 608 transitions. [2021-06-05 14:46:46,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:46,821 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:46,821 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:47,021 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable363,70 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:47,022 INFO L430 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:47,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:47,022 INFO L82 PathProgramCache]: Analyzing trace with hash -2071414893, now seen corresponding path program 61 times [2021-06-05 14:46:47,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:47,022 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864499522] [2021-06-05 14:46:47,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:47,075 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 14:46:47,075 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:47,075 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864499522] [2021-06-05 14:46:47,075 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864499522] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:47,075 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202862132] [2021-06-05 14:46:47,081 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 14:46:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:47,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:47,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:47,182 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 14:46:47,183 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202862132] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:47,183 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:47,183 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 14:46:47,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635328212] [2021-06-05 14:46:47,183 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:46:47,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:47,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:46:47,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:47,183 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 14:46:47,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:47,397 INFO L93 Difference]: Finished difference Result 369 states and 1028 transitions. [2021-06-05 14:46:47,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:47,397 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 14:46:47,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:47,398 INFO L225 Difference]: With dead ends: 369 [2021-06-05 14:46:47,398 INFO L226 Difference]: Without dead ends: 350 [2021-06-05 14:46:47,398 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 228.6ms TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:46:47,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2021-06-05 14:46:47,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 214. [2021-06-05 14:46:47,400 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 14:46:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 622 transitions. [2021-06-05 14:46:47,401 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 622 transitions. Word has length 18 [2021-06-05 14:46:47,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:47,401 INFO L482 AbstractCegarLoop]: Abstraction has 214 states and 622 transitions. [2021-06-05 14:46:47,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 14:46:47,401 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 622 transitions. [2021-06-05 14:46:47,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:47,401 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:47,401 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:47,602 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable366 [2021-06-05 14:46:47,602 INFO L430 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:47,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:47,602 INFO L82 PathProgramCache]: Analyzing trace with hash 2067720571, now seen corresponding path program 62 times [2021-06-05 14:46:47,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:47,602 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39188748] [2021-06-05 14:46:47,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:47,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 14:46:47,801 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:47,801 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39188748] [2021-06-05 14:46:47,801 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39188748] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:47,801 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393175222] [2021-06-05 14:46:47,801 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 14:46:47,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:47,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:47,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:47,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:47,898 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 14:46:47,898 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393175222] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:47,898 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:47,898 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 14:46:47,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846357247] [2021-06-05 14:46:47,898 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:46:47,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:47,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:46:47,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:47,898 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 14:46:48,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:48,101 INFO L93 Difference]: Finished difference Result 412 states and 1121 transitions. [2021-06-05 14:46:48,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:48,101 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 14:46:48,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:48,102 INFO L225 Difference]: With dead ends: 412 [2021-06-05 14:46:48,102 INFO L226 Difference]: Without dead ends: 393 [2021-06-05 14:46:48,102 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 316.4ms TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:46:48,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2021-06-05 14:46:48,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 216. [2021-06-05 14:46:48,104 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 14:46:48,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 629 transitions. [2021-06-05 14:46:48,105 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 629 transitions. Word has length 18 [2021-06-05 14:46:48,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:48,105 INFO L482 AbstractCegarLoop]: Abstraction has 216 states and 629 transitions. [2021-06-05 14:46:48,105 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 14:46:48,105 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 629 transitions. [2021-06-05 14:46:48,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:48,105 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:48,105 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:48,306 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable369 [2021-06-05 14:46:48,306 INFO L430 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:48,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:48,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1297085549, now seen corresponding path program 63 times [2021-06-05 14:46:48,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:48,306 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592805770] [2021-06-05 14:46:48,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:48,353 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 14:46:48,353 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:48,353 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592805770] [2021-06-05 14:46:48,353 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592805770] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:48,353 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092895770] [2021-06-05 14:46:48,353 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 14:46:48,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:46:48,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:48,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:48,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:48,463 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 14:46:48,463 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092895770] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:48,463 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:48,463 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:48,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367900430] [2021-06-05 14:46:48,463 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:48,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:48,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:48,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:48,464 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 14:46:48,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:48,677 INFO L93 Difference]: Finished difference Result 375 states and 1035 transitions. [2021-06-05 14:46:48,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:48,677 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 14:46:48,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:48,678 INFO L225 Difference]: With dead ends: 375 [2021-06-05 14:46:48,678 INFO L226 Difference]: Without dead ends: 352 [2021-06-05 14:46:48,678 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 223.4ms TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:46:48,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-06-05 14:46:48,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 212. [2021-06-05 14:46:48,680 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 14:46:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 617 transitions. [2021-06-05 14:46:48,680 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 617 transitions. Word has length 18 [2021-06-05 14:46:48,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:48,681 INFO L482 AbstractCegarLoop]: Abstraction has 212 states and 617 transitions. [2021-06-05 14:46:48,681 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 14:46:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 617 transitions. [2021-06-05 14:46:48,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:48,681 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:48,681 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:48,881 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable372,73 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:48,881 INFO L430 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:48,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:48,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1181922291, now seen corresponding path program 64 times [2021-06-05 14:46:48,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:48,882 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788526264] [2021-06-05 14:46:48,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:48,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 14:46:48,932 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:48,932 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788526264] [2021-06-05 14:46:48,932 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788526264] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:48,932 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204304778] [2021-06-05 14:46:48,933 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 14:46:48,956 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:46:48,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:48,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:48,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:49,030 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 14:46:49,030 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204304778] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:49,030 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:49,031 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 14:46:49,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629670703] [2021-06-05 14:46:49,031 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:46:49,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:49,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:46:49,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:49,031 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 14:46:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:49,247 INFO L93 Difference]: Finished difference Result 392 states and 1071 transitions. [2021-06-05 14:46:49,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:49,247 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 14:46:49,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:49,248 INFO L225 Difference]: With dead ends: 392 [2021-06-05 14:46:49,248 INFO L226 Difference]: Without dead ends: 373 [2021-06-05 14:46:49,248 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 223.9ms TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:46:49,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-06-05 14:46:49,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 216. [2021-06-05 14:46:49,251 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 14:46:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 631 transitions. [2021-06-05 14:46:49,252 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 631 transitions. Word has length 18 [2021-06-05 14:46:49,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:49,252 INFO L482 AbstractCegarLoop]: Abstraction has 216 states and 631 transitions. [2021-06-05 14:46:49,252 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 14:46:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 631 transitions. [2021-06-05 14:46:49,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:49,252 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:49,252 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:49,452 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable377,74 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:49,453 INFO L430 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:49,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:49,453 INFO L82 PathProgramCache]: Analyzing trace with hash 2112083467, now seen corresponding path program 65 times [2021-06-05 14:46:49,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:49,453 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99835549] [2021-06-05 14:46:49,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:49,495 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 14:46:49,495 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:49,495 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99835549] [2021-06-05 14:46:49,495 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99835549] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:49,495 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174979599] [2021-06-05 14:46:49,495 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 14:46:49,520 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:49,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:49,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:49,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:49,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 14:46:49,607 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174979599] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:49,607 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:49,608 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:49,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365016521] [2021-06-05 14:46:49,608 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:49,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:49,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:49,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:49,608 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 14:46:49,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:49,824 INFO L93 Difference]: Finished difference Result 396 states and 1071 transitions. [2021-06-05 14:46:49,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:49,824 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 14:46:49,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:49,825 INFO L225 Difference]: With dead ends: 396 [2021-06-05 14:46:49,825 INFO L226 Difference]: Without dead ends: 373 [2021-06-05 14:46:49,825 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 242.9ms TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:46:49,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-06-05 14:46:49,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 214. [2021-06-05 14:46:49,827 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 14:46:49,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 624 transitions. [2021-06-05 14:46:49,828 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 624 transitions. Word has length 18 [2021-06-05 14:46:49,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:49,828 INFO L482 AbstractCegarLoop]: Abstraction has 214 states and 624 transitions. [2021-06-05 14:46:49,828 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 14:46:49,828 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 624 transitions. [2021-06-05 14:46:49,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:49,828 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:49,828 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:50,028 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable380 [2021-06-05 14:46:50,029 INFO L430 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:50,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:50,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1099390935, now seen corresponding path program 66 times [2021-06-05 14:46:50,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:50,029 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467309720] [2021-06-05 14:46:50,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:50,079 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 14:46:50,080 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:50,080 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467309720] [2021-06-05 14:46:50,080 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467309720] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:50,080 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753020471] [2021-06-05 14:46:50,080 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 14:46:50,107 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:46:50,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:50,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:50,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:50,167 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 14:46:50,167 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753020471] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:50,167 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:50,167 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:46:50,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924229913] [2021-06-05 14:46:50,167 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:46:50,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:50,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:46:50,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:50,167 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 14:46:50,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:50,363 INFO L93 Difference]: Finished difference Result 361 states and 998 transitions. [2021-06-05 14:46:50,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:50,364 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 14:46:50,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:50,364 INFO L225 Difference]: With dead ends: 361 [2021-06-05 14:46:50,364 INFO L226 Difference]: Without dead ends: 334 [2021-06-05 14:46:50,364 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 208.6ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:50,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-06-05 14:46:50,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 212. [2021-06-05 14:46:50,366 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 14:46:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 617 transitions. [2021-06-05 14:46:50,367 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 617 transitions. Word has length 18 [2021-06-05 14:46:50,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:50,367 INFO L482 AbstractCegarLoop]: Abstraction has 212 states and 617 transitions. [2021-06-05 14:46:50,367 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 14:46:50,367 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 617 transitions. [2021-06-05 14:46:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:50,367 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:50,367 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:50,567 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable385,76 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:50,568 INFO L430 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:50,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:50,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1459644047, now seen corresponding path program 67 times [2021-06-05 14:46:50,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:50,568 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362215576] [2021-06-05 14:46:50,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:50,617 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 14:46:50,617 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:50,617 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362215576] [2021-06-05 14:46:50,617 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362215576] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:50,617 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606422347] [2021-06-05 14:46:50,617 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 14:46:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:50,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:50,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:50,707 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 14:46:50,707 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606422347] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:50,707 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:50,707 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 14:46:50,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821273770] [2021-06-05 14:46:50,708 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:46:50,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:50,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:46:50,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:50,708 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 14:46:50,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:50,888 INFO L93 Difference]: Finished difference Result 491 states and 1355 transitions. [2021-06-05 14:46:50,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:50,889 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 14:46:50,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:50,889 INFO L225 Difference]: With dead ends: 491 [2021-06-05 14:46:50,889 INFO L226 Difference]: Without dead ends: 472 [2021-06-05 14:46:50,889 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 176.1ms TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:46:50,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-06-05 14:46:50,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 218. [2021-06-05 14:46:50,892 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 14:46:50,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 638 transitions. [2021-06-05 14:46:50,893 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 638 transitions. Word has length 18 [2021-06-05 14:46:50,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:50,893 INFO L482 AbstractCegarLoop]: Abstraction has 218 states and 638 transitions. [2021-06-05 14:46:50,893 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 14:46:50,893 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 638 transitions. [2021-06-05 14:46:50,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:50,893 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:50,893 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:51,093 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable390,77 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:51,094 INFO L430 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:51,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:51,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1303812215, now seen corresponding path program 68 times [2021-06-05 14:46:51,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:51,094 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715683774] [2021-06-05 14:46:51,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:51,144 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 14:46:51,144 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:51,144 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715683774] [2021-06-05 14:46:51,144 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715683774] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:51,144 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818071114] [2021-06-05 14:46:51,144 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 14:46:51,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:51,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:51,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:51,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:51,240 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 14:46:51,240 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818071114] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:51,240 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:51,240 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 14:46:51,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901906305] [2021-06-05 14:46:51,240 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:46:51,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:51,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:46:51,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:51,241 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 14:46:51,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:51,419 INFO L93 Difference]: Finished difference Result 526 states and 1428 transitions. [2021-06-05 14:46:51,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:51,419 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 14:46:51,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:51,419 INFO L225 Difference]: With dead ends: 526 [2021-06-05 14:46:51,419 INFO L226 Difference]: Without dead ends: 507 [2021-06-05 14:46:51,420 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 185.6ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:46:51,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-06-05 14:46:51,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 222. [2021-06-05 14:46:51,423 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 14:46:51,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 654 transitions. [2021-06-05 14:46:51,423 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 654 transitions. Word has length 18 [2021-06-05 14:46:51,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:51,423 INFO L482 AbstractCegarLoop]: Abstraction has 222 states and 654 transitions. [2021-06-05 14:46:51,423 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 14:46:51,423 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 654 transitions. [2021-06-05 14:46:51,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:51,423 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:51,423 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:51,639 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable393,78 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:51,639 INFO L430 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:51,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:51,639 INFO L82 PathProgramCache]: Analyzing trace with hash -2060993905, now seen corresponding path program 69 times [2021-06-05 14:46:51,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:51,640 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909241921] [2021-06-05 14:46:51,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46: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 14:46:51,681 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:51,681 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909241921] [2021-06-05 14:46:51,681 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909241921] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:51,682 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44169672] [2021-06-05 14:46:51,682 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 14:46:51,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:46:51,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:51,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:51,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:51,790 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 14:46:51,790 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44169672] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:51,790 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:51,790 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:51,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395361028] [2021-06-05 14:46:51,790 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:51,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:51,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:51,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:51,791 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 14:46:51,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:51,976 INFO L93 Difference]: Finished difference Result 489 states and 1342 transitions. [2021-06-05 14:46:51,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:51,977 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 14:46:51,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:51,977 INFO L225 Difference]: With dead ends: 489 [2021-06-05 14:46:51,977 INFO L226 Difference]: Without dead ends: 466 [2021-06-05 14:46:51,977 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 192.0ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:51,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-06-05 14:46:51,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 222. [2021-06-05 14:46:51,980 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 14:46:51,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 650 transitions. [2021-06-05 14:46:51,980 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 650 transitions. Word has length 18 [2021-06-05 14:46:51,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:51,980 INFO L482 AbstractCegarLoop]: Abstraction has 222 states and 650 transitions. [2021-06-05 14:46:51,981 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 14:46:51,981 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 650 transitions. [2021-06-05 14:46:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:51,981 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:51,981 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:52,181 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable396,79 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:52,181 INFO L430 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:52,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:52,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1255509907, now seen corresponding path program 70 times [2021-06-05 14:46:52,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:52,182 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594999635] [2021-06-05 14:46:52,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:52,226 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 14:46:52,226 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:52,226 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594999635] [2021-06-05 14:46:52,226 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594999635] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:52,226 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784087497] [2021-06-05 14:46:52,226 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 14:46:52,252 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:46:52,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:52,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:52,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:52,321 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 14:46:52,322 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784087497] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:52,322 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:52,322 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 14:46:52,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338463262] [2021-06-05 14:46:52,322 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:46:52,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:52,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:46:52,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:52,322 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 14:46:52,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:52,476 INFO L93 Difference]: Finished difference Result 452 states and 1260 transitions. [2021-06-05 14:46:52,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:52,476 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 14:46:52,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:52,477 INFO L225 Difference]: With dead ends: 452 [2021-06-05 14:46:52,477 INFO L226 Difference]: Without dead ends: 433 [2021-06-05 14:46:52,477 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 145.9ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:46:52,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-06-05 14:46:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 217. [2021-06-05 14:46:52,480 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 14:46:52,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 637 transitions. [2021-06-05 14:46:52,480 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 637 transitions. Word has length 18 [2021-06-05 14:46:52,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:52,480 INFO L482 AbstractCegarLoop]: Abstraction has 217 states and 637 transitions. [2021-06-05 14:46:52,480 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 14:46:52,480 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 637 transitions. [2021-06-05 14:46:52,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:52,480 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:52,480 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:52,684 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable401,80 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:52,685 INFO L430 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:52,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:52,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1030444307, now seen corresponding path program 71 times [2021-06-05 14:46:52,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:52,686 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839124826] [2021-06-05 14:46:52,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:52,723 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 14:46:52,723 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:52,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839124826] [2021-06-05 14:46:52,723 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839124826] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:52,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403316154] [2021-06-05 14:46:52,723 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 14:46:52,750 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:52,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:52,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:52,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:52,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 14:46:52,814 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403316154] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:52,815 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:52,815 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:52,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958423736] [2021-06-05 14:46:52,815 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:52,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:52,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:52,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:52,815 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 14:46:52,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:52,941 INFO L93 Difference]: Finished difference Result 433 states and 1227 transitions. [2021-06-05 14:46:52,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:52,942 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 14:46:52,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:52,942 INFO L225 Difference]: With dead ends: 433 [2021-06-05 14:46:52,942 INFO L226 Difference]: Without dead ends: 414 [2021-06-05 14:46:52,942 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 110.3ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:52,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-06-05 14:46:52,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 221. [2021-06-05 14:46:52,945 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 14:46:52,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 657 transitions. [2021-06-05 14:46:52,945 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 657 transitions. Word has length 18 [2021-06-05 14:46:52,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:52,946 INFO L482 AbstractCegarLoop]: Abstraction has 221 states and 657 transitions. [2021-06-05 14:46:52,946 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 14:46:52,946 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 657 transitions. [2021-06-05 14:46:52,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:52,946 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:52,946 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:53,148 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 81 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable404 [2021-06-05 14:46:53,149 INFO L430 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:53,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:53,149 INFO L82 PathProgramCache]: Analyzing trace with hash -668276081, now seen corresponding path program 72 times [2021-06-05 14:46:53,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:53,149 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401899639] [2021-06-05 14:46:53,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:53,181 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 14:46:53,181 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:53,182 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401899639] [2021-06-05 14:46:53,182 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401899639] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:53,182 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832813931] [2021-06-05 14:46:53,182 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 14:46:53,206 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:46:53,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:53,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:53,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:53,251 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 14:46:53,251 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832813931] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:53,251 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:53,251 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 14:46:53,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424850499] [2021-06-05 14:46:53,251 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:46:53,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:53,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:46:53,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:46:53,251 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 14:46:53,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:53,361 INFO L93 Difference]: Finished difference Result 404 states and 1161 transitions. [2021-06-05 14:46:53,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:53,362 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 14:46:53,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:53,362 INFO L225 Difference]: With dead ends: 404 [2021-06-05 14:46:53,362 INFO L226 Difference]: Without dead ends: 385 [2021-06-05 14:46:53,362 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 89.5ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-06-05 14:46:53,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 213. [2021-06-05 14:46:53,365 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 14:46:53,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 621 transitions. [2021-06-05 14:46:53,365 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 621 transitions. Word has length 18 [2021-06-05 14:46:53,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:53,365 INFO L482 AbstractCegarLoop]: Abstraction has 213 states and 621 transitions. [2021-06-05 14:46:53,365 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 14:46:53,365 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 621 transitions. [2021-06-05 14:46:53,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:53,366 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:53,366 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:53,566 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable407,82 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:53,566 INFO L430 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:53,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:53,566 INFO L82 PathProgramCache]: Analyzing trace with hash -188192517, now seen corresponding path program 73 times [2021-06-05 14:46:53,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:53,567 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272596841] [2021-06-05 14:46:53,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:53,612 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 14:46:53,612 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:53,612 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272596841] [2021-06-05 14:46:53,612 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272596841] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:53,612 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816588119] [2021-06-05 14:46:53,613 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 14:46:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:53,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:53,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:53,704 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 14:46:53,704 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816588119] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:53,704 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:53,704 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2021-06-05 14:46:53,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606758596] [2021-06-05 14:46:53,704 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:46:53,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:53,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:46:53,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:46:53,704 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 14:46:53,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:53,875 INFO L93 Difference]: Finished difference Result 502 states and 1407 transitions. [2021-06-05 14:46:53,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:53,875 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 14:46:53,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:53,875 INFO L225 Difference]: With dead ends: 502 [2021-06-05 14:46:53,875 INFO L226 Difference]: Without dead ends: 483 [2021-06-05 14:46:53,876 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 156.1ms TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:53,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2021-06-05 14:46:53,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 219. [2021-06-05 14:46:53,878 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 14:46:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 648 transitions. [2021-06-05 14:46:53,879 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 648 transitions. Word has length 18 [2021-06-05 14:46:53,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:53,879 INFO L482 AbstractCegarLoop]: Abstraction has 219 states and 648 transitions. [2021-06-05 14:46:53,879 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 14:46:53,879 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 648 transitions. [2021-06-05 14:46:53,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:53,879 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:53,879 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:54,079 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable410 [2021-06-05 14:46:54,080 INFO L430 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:54,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:54,080 INFO L82 PathProgramCache]: Analyzing trace with hash 741968659, now seen corresponding path program 74 times [2021-06-05 14:46:54,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:54,080 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853830785] [2021-06-05 14:46:54,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:54,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 14:46:54,118 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:54,118 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853830785] [2021-06-05 14:46:54,118 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853830785] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:54,118 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477240041] [2021-06-05 14:46:54,118 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 14:46:54,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:54,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:54,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:54,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:54,217 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 14:46:54,218 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477240041] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:54,218 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:54,218 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:46:54,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765340468] [2021-06-05 14:46:54,218 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:54,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:54,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:54,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:54,218 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 14:46:54,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:54,368 INFO L93 Difference]: Finished difference Result 490 states and 1367 transitions. [2021-06-05 14:46:54,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:54,368 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 14:46:54,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:54,369 INFO L225 Difference]: With dead ends: 490 [2021-06-05 14:46:54,369 INFO L226 Difference]: Without dead ends: 467 [2021-06-05 14:46:54,369 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 144.7ms TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:46:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2021-06-05 14:46:54,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 221. [2021-06-05 14:46:54,371 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 14:46:54,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 649 transitions. [2021-06-05 14:46:54,372 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 649 transitions. Word has length 18 [2021-06-05 14:46:54,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:54,372 INFO L482 AbstractCegarLoop]: Abstraction has 221 states and 649 transitions. [2021-06-05 14:46:54,372 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 14:46:54,372 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 649 transitions. [2021-06-05 14:46:54,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:54,372 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:54,372 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:54,573 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable413,84 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:54,573 INFO L430 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:54,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:54,573 INFO L82 PathProgramCache]: Analyzing trace with hash 82317175, now seen corresponding path program 75 times [2021-06-05 14:46:54,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:54,573 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966552218] [2021-06-05 14:46:54,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:54,618 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 14:46:54,619 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:54,619 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966552218] [2021-06-05 14:46:54,619 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966552218] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:54,619 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476894974] [2021-06-05 14:46:54,619 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 14:46:54,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:46:54,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:54,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:54,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:54,715 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 14:46:54,715 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476894974] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:54,715 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:54,715 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 14:46:54,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022943800] [2021-06-05 14:46:54,716 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:46:54,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:54,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:46:54,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:54,716 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 14:46:54,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:54,914 INFO L93 Difference]: Finished difference Result 505 states and 1410 transitions. [2021-06-05 14:46:54,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:54,915 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 14:46:54,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:54,915 INFO L225 Difference]: With dead ends: 505 [2021-06-05 14:46:54,915 INFO L226 Difference]: Without dead ends: 486 [2021-06-05 14:46:54,915 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 180.4ms TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:46:54,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2021-06-05 14:46:54,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 218. [2021-06-05 14:46:54,918 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 14:46:54,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 646 transitions. [2021-06-05 14:46:54,918 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 646 transitions. Word has length 18 [2021-06-05 14:46:54,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:54,919 INFO L482 AbstractCegarLoop]: Abstraction has 218 states and 646 transitions. [2021-06-05 14:46:54,919 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 14:46:54,919 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 646 transitions. [2021-06-05 14:46:54,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:54,919 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:54,919 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:55,119 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 85 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable418 [2021-06-05 14:46:55,119 INFO L430 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:55,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:55,120 INFO L82 PathProgramCache]: Analyzing trace with hash -98811273, now seen corresponding path program 76 times [2021-06-05 14:46:55,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:55,120 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054097819] [2021-06-05 14:46:55,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:55,153 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 14:46:55,153 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:55,153 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054097819] [2021-06-05 14:46:55,153 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054097819] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:55,153 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030515387] [2021-06-05 14:46:55,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 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 14:46:55,178 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:46:55,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:55,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:55,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:55,244 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 14:46:55,244 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030515387] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:55,244 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:55,244 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:46:55,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230381380] [2021-06-05 14:46:55,244 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:46:55,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:55,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:46:55,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:55,244 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 14:46:55,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:55,349 INFO L93 Difference]: Finished difference Result 486 states and 1381 transitions. [2021-06-05 14:46:55,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:55,349 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 14:46:55,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:55,350 INFO L225 Difference]: With dead ends: 486 [2021-06-05 14:46:55,350 INFO L226 Difference]: Without dead ends: 467 [2021-06-05 14:46:55,350 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 95.3ms TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:55,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2021-06-05 14:46:55,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 214. [2021-06-05 14:46:55,353 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 14:46:55,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 626 transitions. [2021-06-05 14:46:55,353 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 626 transitions. Word has length 18 [2021-06-05 14:46:55,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:55,353 INFO L482 AbstractCegarLoop]: Abstraction has 214 states and 626 transitions. [2021-06-05 14:46:55,353 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 14:46:55,353 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 626 transitions. [2021-06-05 14:46:55,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:55,353 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:55,353 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:55,554 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable422 [2021-06-05 14:46:55,554 INFO L430 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:55,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:55,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1980104049, now seen corresponding path program 77 times [2021-06-05 14:46:55,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:55,554 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846883791] [2021-06-05 14:46:55,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:55,590 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 14:46:55,590 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:55,590 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846883791] [2021-06-05 14:46:55,590 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846883791] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:55,590 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225482046] [2021-06-05 14:46:55,590 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 14:46:55,614 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:55,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:55,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:55,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:55,682 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 14:46:55,682 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225482046] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:55,682 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:55,682 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:46:55,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203963061] [2021-06-05 14:46:55,683 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:46:55,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:55,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:46:55,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:55,683 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 14:46:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:55,856 INFO L93 Difference]: Finished difference Result 443 states and 1246 transitions. [2021-06-05 14:46:55,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:55,856 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 14:46:55,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:55,857 INFO L225 Difference]: With dead ends: 443 [2021-06-05 14:46:55,857 INFO L226 Difference]: Without dead ends: 420 [2021-06-05 14:46:55,857 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 151.1ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:55,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2021-06-05 14:46:55,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 222. [2021-06-05 14:46:55,860 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 14:46:55,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 648 transitions. [2021-06-05 14:46:55,860 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 648 transitions. Word has length 18 [2021-06-05 14:46:55,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:55,860 INFO L482 AbstractCegarLoop]: Abstraction has 222 states and 648 transitions. [2021-06-05 14:46:55,860 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 14:46:55,860 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 648 transitions. [2021-06-05 14:46:55,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:55,860 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:55,861 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:56,061 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 87 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable425 [2021-06-05 14:46:56,061 INFO L430 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:56,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:56,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1001546605, now seen corresponding path program 78 times [2021-06-05 14:46:56,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:56,061 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372630326] [2021-06-05 14:46:56,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:56,099 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 14:46:56,099 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:56,099 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372630326] [2021-06-05 14:46:56,099 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372630326] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:56,099 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586519062] [2021-06-05 14:46:56,099 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 14:46:56,123 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:46:56,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:56,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:56,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:56,184 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 14:46:56,184 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586519062] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:56,184 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:56,184 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:46:56,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137961493] [2021-06-05 14:46:56,184 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:46:56,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:56,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:46:56,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:56,185 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 14:46:56,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:56,332 INFO L93 Difference]: Finished difference Result 427 states and 1216 transitions. [2021-06-05 14:46:56,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:56,333 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 14:46:56,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:56,333 INFO L225 Difference]: With dead ends: 427 [2021-06-05 14:46:56,333 INFO L226 Difference]: Without dead ends: 408 [2021-06-05 14:46:56,333 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 139.5ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:56,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-06-05 14:46:56,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 212. [2021-06-05 14:46:56,336 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 14:46:56,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 617 transitions. [2021-06-05 14:46:56,336 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 617 transitions. Word has length 18 [2021-06-05 14:46:56,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:56,336 INFO L482 AbstractCegarLoop]: Abstraction has 212 states and 617 transitions. [2021-06-05 14:46:56,336 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 14:46:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 617 transitions. [2021-06-05 14:46:56,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:56,337 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:56,337 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:56,538 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 88 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable430 [2021-06-05 14:46:56,539 INFO L430 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:56,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:56,539 INFO L82 PathProgramCache]: Analyzing trace with hash -2120551441, now seen corresponding path program 79 times [2021-06-05 14:46:56,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:56,539 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221066128] [2021-06-05 14:46:56,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:56,593 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 14:46:56,593 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:56,594 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221066128] [2021-06-05 14:46:56,594 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221066128] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:56,594 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279924783] [2021-06-05 14:46:56,594 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 14:46:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:56,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:56,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:56,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 14:46:56,683 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279924783] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:56,683 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:56,683 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2021-06-05 14:46:56,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760422069] [2021-06-05 14:46:56,684 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:56,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:56,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:56,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:56,684 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 14:46:56,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:56,898 INFO L93 Difference]: Finished difference Result 424 states and 1183 transitions. [2021-06-05 14:46:56,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:56,899 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 14:46:56,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:56,899 INFO L225 Difference]: With dead ends: 424 [2021-06-05 14:46:56,899 INFO L226 Difference]: Without dead ends: 405 [2021-06-05 14:46:56,899 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 203.7ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:46:56,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2021-06-05 14:46:56,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 217. [2021-06-05 14:46:56,902 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 14:46:56,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 636 transitions. [2021-06-05 14:46:56,902 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 636 transitions. Word has length 18 [2021-06-05 14:46:56,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:56,902 INFO L482 AbstractCegarLoop]: Abstraction has 217 states and 636 transitions. [2021-06-05 14:46:56,902 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 14:46:56,902 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 636 transitions. [2021-06-05 14:46:56,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:56,903 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:56,903 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:57,103 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable433 [2021-06-05 14:46:57,103 INFO L430 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:57,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:57,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1190390265, now seen corresponding path program 80 times [2021-06-05 14:46:57,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:57,103 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468595147] [2021-06-05 14:46:57,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:57,143 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 14:46:57,143 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:57,143 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468595147] [2021-06-05 14:46:57,143 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468595147] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:57,143 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323318099] [2021-06-05 14:46:57,143 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 14:46:57,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:57,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:57,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:57,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:57,229 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 14:46:57,230 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323318099] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:57,230 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:57,230 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:46:57,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100997256] [2021-06-05 14:46:57,230 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:46:57,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:57,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:46:57,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:57,230 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 14:46:57,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:57,479 INFO L93 Difference]: Finished difference Result 428 states and 1183 transitions. [2021-06-05 14:46:57,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:57,479 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 14:46:57,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:57,480 INFO L225 Difference]: With dead ends: 428 [2021-06-05 14:46:57,480 INFO L226 Difference]: Without dead ends: 405 [2021-06-05 14:46:57,480 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 222.3ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:46:57,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2021-06-05 14:46:57,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 215. [2021-06-05 14:46:57,482 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 14:46:57,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 629 transitions. [2021-06-05 14:46:57,483 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 629 transitions. Word has length 18 [2021-06-05 14:46:57,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:57,483 INFO L482 AbstractCegarLoop]: Abstraction has 215 states and 629 transitions. [2021-06-05 14:46:57,483 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 14:46:57,483 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 629 transitions. [2021-06-05 14:46:57,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:57,483 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:57,483 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:57,683 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable436,90 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:57,684 INFO L430 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:57,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:57,684 INFO L82 PathProgramCache]: Analyzing trace with hash 2091884499, now seen corresponding path program 81 times [2021-06-05 14:46:57,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:57,684 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577446724] [2021-06-05 14:46:57,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:57,722 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 14:46:57,722 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:57,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577446724] [2021-06-05 14:46:57,723 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577446724] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:57,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683859699] [2021-06-05 14:46:57,723 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 14:46:57,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:46:57,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:57,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:57,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:57,798 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 14:46:57,798 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683859699] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:57,798 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:57,798 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 14:46:57,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975522566] [2021-06-05 14:46:57,798 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:46:57,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:57,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:46:57,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:46:57,799 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 14:46:57,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:57,996 INFO L93 Difference]: Finished difference Result 422 states and 1164 transitions. [2021-06-05 14:46:57,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:57,996 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 14:46:57,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:57,996 INFO L225 Difference]: With dead ends: 422 [2021-06-05 14:46:57,996 INFO L226 Difference]: Without dead ends: 395 [2021-06-05 14:46:57,996 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 184.8ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:57,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-06-05 14:46:57,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 213. [2021-06-05 14:46:57,999 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 14:46:57,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 622 transitions. [2021-06-05 14:46:57,999 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 622 transitions. Word has length 18 [2021-06-05 14:46:57,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:57,999 INFO L482 AbstractCegarLoop]: Abstraction has 213 states and 622 transitions. [2021-06-05 14:46:57,999 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 14:46:57,999 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 622 transitions. [2021-06-05 14:46:58,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:58,000 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:58,000 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:58,200 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 91 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable441 [2021-06-05 14:46:58,200 INFO L430 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:58,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:58,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1036814989, now seen corresponding path program 82 times [2021-06-05 14:46:58,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:58,201 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987338981] [2021-06-05 14:46:58,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:58,247 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 14:46:58,247 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:58,248 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987338981] [2021-06-05 14:46:58,248 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987338981] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:58,248 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790650669] [2021-06-05 14:46:58,248 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 14:46:58,272 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:46:58,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:58,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:58,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:58,330 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 14:46:58,330 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790650669] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:58,330 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:58,330 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2021-06-05 14:46:58,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028226988] [2021-06-05 14:46:58,330 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:46:58,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:58,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:46:58,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:46:58,330 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 14:46:58,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:58,488 INFO L93 Difference]: Finished difference Result 441 states and 1207 transitions. [2021-06-05 14:46:58,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:58,488 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 14:46:58,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:58,489 INFO L225 Difference]: With dead ends: 441 [2021-06-05 14:46:58,489 INFO L226 Difference]: Without dead ends: 422 [2021-06-05 14:46:58,489 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 145.5ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:46:58,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-06-05 14:46:58,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 219. [2021-06-05 14:46:58,491 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 14:46:58,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 649 transitions. [2021-06-05 14:46:58,492 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 649 transitions. Word has length 18 [2021-06-05 14:46:58,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:58,492 INFO L482 AbstractCegarLoop]: Abstraction has 219 states and 649 transitions. [2021-06-05 14:46:58,492 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 14:46:58,492 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 649 transitions. [2021-06-05 14:46:58,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:58,492 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:58,492 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:58,702 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 92 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable446 [2021-06-05 14:46:58,702 INFO L430 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:58,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:58,702 INFO L82 PathProgramCache]: Analyzing trace with hash -106653813, now seen corresponding path program 83 times [2021-06-05 14:46:58,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:58,702 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585022197] [2021-06-05 14:46:58,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:58,740 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 14:46:58,740 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:58,740 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585022197] [2021-06-05 14:46:58,740 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585022197] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:58,740 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13581934] [2021-06-05 14:46:58,740 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 14:46:58,765 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:46:58,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:58,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:58,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:58,826 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 14:46:58,826 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13581934] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:58,826 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:58,826 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:46:58,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220741634] [2021-06-05 14:46:58,827 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:46:58,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:58,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:46:58,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:58,827 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 14:46:58,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:58,988 INFO L93 Difference]: Finished difference Result 445 states and 1207 transitions. [2021-06-05 14:46:58,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:58,988 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 14:46:58,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:58,988 INFO L225 Difference]: With dead ends: 445 [2021-06-05 14:46:58,988 INFO L226 Difference]: Without dead ends: 422 [2021-06-05 14:46:58,989 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 140.5ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:58,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-06-05 14:46:58,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 221. [2021-06-05 14:46:58,991 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 14:46:58,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 650 transitions. [2021-06-05 14:46:58,992 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 650 transitions. Word has length 18 [2021-06-05 14:46:58,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:58,992 INFO L482 AbstractCegarLoop]: Abstraction has 221 states and 650 transitions. [2021-06-05 14:46:58,992 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 14:46:58,992 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 650 transitions. [2021-06-05 14:46:58,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:58,992 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:58,992 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:59,208 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable449,93 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:46:59,208 INFO L430 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:59,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:59,208 INFO L82 PathProgramCache]: Analyzing trace with hash -766305297, now seen corresponding path program 84 times [2021-06-05 14:46:59,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:59,208 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246537803] [2021-06-05 14:46:59,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:59,253 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 14:46:59,253 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:59,253 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246537803] [2021-06-05 14:46:59,253 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246537803] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:59,253 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667131975] [2021-06-05 14:46:59,253 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 14:46:59,277 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:46:59,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:46:59,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:59,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:59,356 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 14:46:59,356 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667131975] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:59,356 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:59,356 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 14:46:59,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827862355] [2021-06-05 14:46:59,356 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:46:59,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:59,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:46:59,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:59,356 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 14:46:59,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:59,542 INFO L93 Difference]: Finished difference Result 414 states and 1142 transitions. [2021-06-05 14:46:59,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:59,542 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 14:46:59,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:59,543 INFO L225 Difference]: With dead ends: 414 [2021-06-05 14:46:59,543 INFO L226 Difference]: Without dead ends: 395 [2021-06-05 14:46:59,543 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 180.9ms TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:46:59,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-06-05 14:46:59,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 218. [2021-06-05 14:46:59,545 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 14:46:59,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 647 transitions. [2021-06-05 14:46:59,546 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 647 transitions. Word has length 18 [2021-06-05 14:46:59,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:59,546 INFO L482 AbstractCegarLoop]: Abstraction has 218 states and 647 transitions. [2021-06-05 14:46:59,546 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 14:46:59,546 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 647 transitions. [2021-06-05 14:46:59,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:59,546 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:59,546 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:46:59,746 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 94 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable454 [2021-06-05 14:46:59,747 INFO L430 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:46:59,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:46:59,747 INFO L82 PathProgramCache]: Analyzing trace with hash -947433745, now seen corresponding path program 85 times [2021-06-05 14:46:59,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:46:59,747 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909753104] [2021-06-05 14:46:59,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:46:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:59,780 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 14:46:59,780 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:46:59,780 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909753104] [2021-06-05 14:46:59,780 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909753104] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:59,780 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351895691] [2021-06-05 14:46:59,780 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 14:46:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:46:59,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:46:59,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:46:59,857 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 14:46:59,857 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351895691] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:46:59,857 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:46:59,858 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:46:59,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766204942] [2021-06-05 14:46:59,858 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:46:59,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:46:59,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:46:59,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:46:59,858 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 14:46:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:46:59,979 INFO L93 Difference]: Finished difference Result 386 states and 1091 transitions. [2021-06-05 14:46:59,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:46:59,979 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 14:46:59,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:46:59,979 INFO L225 Difference]: With dead ends: 386 [2021-06-05 14:46:59,979 INFO L226 Difference]: Without dead ends: 367 [2021-06-05 14:46:59,980 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 91.9ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:46:59,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-06-05 14:46:59,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 214. [2021-06-05 14:46:59,982 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 14:46:59,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 627 transitions. [2021-06-05 14:46:59,982 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 627 transitions. Word has length 18 [2021-06-05 14:46:59,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:46:59,982 INFO L482 AbstractCegarLoop]: Abstraction has 214 states and 627 transitions. [2021-06-05 14:46:59,982 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 14:46:59,982 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 627 transitions. [2021-06-05 14:46:59,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:46:59,983 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:46:59,983 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:47:00,183 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable458,95 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:00,183 INFO L430 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:00,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:00,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1466240775, now seen corresponding path program 86 times [2021-06-05 14:47:00,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:00,184 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409128007] [2021-06-05 14:47:00,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:00,219 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 14:47:00,219 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:00,219 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409128007] [2021-06-05 14:47:00,219 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409128007] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:00,219 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514160650] [2021-06-05 14:47:00,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 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 14:47:00,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:00,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:00,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:47:00,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:00,322 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 14:47:00,322 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514160650] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:00,322 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:00,322 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-06-05 14:47:00,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545211620] [2021-06-05 14:47:00,322 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:47:00,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:00,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:47:00,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:00,323 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 14:47:00,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:00,532 INFO L93 Difference]: Finished difference Result 422 states and 1166 transitions. [2021-06-05 14:47:00,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:47:00,532 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 14:47:00,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:00,532 INFO L225 Difference]: With dead ends: 422 [2021-06-05 14:47:00,533 INFO L226 Difference]: Without dead ends: 399 [2021-06-05 14:47:00,533 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 204.8ms TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:47:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2021-06-05 14:47:00,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 222. [2021-06-05 14:47:00,535 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 14:47:00,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 649 transitions. [2021-06-05 14:47:00,535 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 649 transitions. Word has length 18 [2021-06-05 14:47:00,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:00,535 INFO L482 AbstractCegarLoop]: Abstraction has 222 states and 649 transitions. [2021-06-05 14:47:00,536 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 14:47:00,536 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 649 transitions. [2021-06-05 14:47:00,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:47:00,536 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:00,536 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:47:00,736 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable461,96 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:00,736 INFO L430 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:00,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:00,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1850169077, now seen corresponding path program 87 times [2021-06-05 14:47:00,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:00,737 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262683835] [2021-06-05 14:47:00,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:00,775 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 14:47:00,775 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:00,775 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262683835] [2021-06-05 14:47:00,775 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262683835] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:00,775 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545793843] [2021-06-05 14:47:00,775 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 14:47:00,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:47:00,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:00,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:47:00,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:00,861 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 14:47:00,862 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545793843] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:00,862 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:00,862 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:47:00,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484179365] [2021-06-05 14:47:00,862 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:00,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:00,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:00,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:00,862 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 14:47:01,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:01,011 INFO L93 Difference]: Finished difference Result 406 states and 1136 transitions. [2021-06-05 14:47:01,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:47:01,012 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 14:47:01,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:01,012 INFO L225 Difference]: With dead ends: 406 [2021-06-05 14:47:01,012 INFO L226 Difference]: Without dead ends: 387 [2021-06-05 14:47:01,012 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 139.7ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:47:01,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-06-05 14:47:01,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 213. [2021-06-05 14:47:01,015 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 14:47:01,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 622 transitions. [2021-06-05 14:47:01,015 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 622 transitions. Word has length 18 [2021-06-05 14:47:01,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:01,015 INFO L482 AbstractCegarLoop]: Abstraction has 213 states and 622 transitions. [2021-06-05 14:47:01,015 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 14:47:01,015 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 622 transitions. [2021-06-05 14:47:01,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:47:01,015 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:01,015 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:47:01,216 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 97 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable466 [2021-06-05 14:47:01,216 INFO L430 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:01,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:01,216 INFO L82 PathProgramCache]: Analyzing trace with hash -687990825, now seen corresponding path program 88 times [2021-06-05 14:47:01,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:01,216 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086359103] [2021-06-05 14:47:01,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:01,253 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 14:47:01,253 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:01,253 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086359103] [2021-06-05 14:47:01,253 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086359103] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:01,253 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30838073] [2021-06-05 14:47:01,253 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 14:47:01,277 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:47:01,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:01,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:47:01,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:01,327 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 14:47:01,328 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30838073] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:01,328 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:01,328 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 14:47:01,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841038418] [2021-06-05 14:47:01,332 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:01,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:01,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:01,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:01,332 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 14:47:01,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:01,507 INFO L93 Difference]: Finished difference Result 366 states and 1018 transitions. [2021-06-05 14:47:01,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:47:01,508 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 14:47:01,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:01,508 INFO L225 Difference]: With dead ends: 366 [2021-06-05 14:47:01,508 INFO L226 Difference]: Without dead ends: 339 [2021-06-05 14:47:01,508 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 168.4ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:47:01,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-06-05 14:47:01,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 215. [2021-06-05 14:47:01,510 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 14:47:01,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 627 transitions. [2021-06-05 14:47:01,511 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 627 transitions. Word has length 18 [2021-06-05 14:47:01,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:01,511 INFO L482 AbstractCegarLoop]: Abstraction has 215 states and 627 transitions. [2021-06-05 14:47:01,511 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 14:47:01,511 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 627 transitions. [2021-06-05 14:47:01,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:47:01,511 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:01,511 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:47:01,712 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 98 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable469 [2021-06-05 14:47:01,712 INFO L430 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:01,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:01,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1068673581, now seen corresponding path program 89 times [2021-06-05 14:47:01,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:01,712 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261773210] [2021-06-05 14:47:01,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:01,750 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 14:47:01,750 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:01,750 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261773210] [2021-06-05 14:47:01,750 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261773210] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:01,750 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842813760] [2021-06-05 14:47:01,750 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 14:47:01,775 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:01,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:01,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:47:01,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:01,843 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 14:47:01,843 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842813760] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:01,843 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:01,843 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:47:01,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202180936] [2021-06-05 14:47:01,844 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:01,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:01,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:01,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:01,844 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 14:47:02,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:02,029 INFO L93 Difference]: Finished difference Result 358 states and 1000 transitions. [2021-06-05 14:47:02,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:47:02,030 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 14:47:02,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:02,030 INFO L225 Difference]: With dead ends: 358 [2021-06-05 14:47:02,030 INFO L226 Difference]: Without dead ends: 335 [2021-06-05 14:47:02,030 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 185.2ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:47:02,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-06-05 14:47:02,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 223. [2021-06-05 14:47:02,033 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 14:47:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 649 transitions. [2021-06-05 14:47:02,033 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 649 transitions. Word has length 18 [2021-06-05 14:47:02,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:02,033 INFO L482 AbstractCegarLoop]: Abstraction has 223 states and 649 transitions. [2021-06-05 14:47:02,033 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 14:47:02,033 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 649 transitions. [2021-06-05 14:47:02,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:47:02,033 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:02,033 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:47:02,234 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable474,99 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:02,234 INFO L430 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:02,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:02,234 INFO L82 PathProgramCache]: Analyzing trace with hash -90116137, now seen corresponding path program 90 times [2021-06-05 14:47:02,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:02,234 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179545372] [2021-06-05 14:47:02,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:02,272 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 14:47:02,272 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:02,272 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179545372] [2021-06-05 14:47:02,272 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179545372] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:02,272 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871213626] [2021-06-05 14:47:02,272 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 14:47:02,296 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:47:02,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:02,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 14:47:02,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:02,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 14:47:02,358 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871213626] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:02,358 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:02,358 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:47:02,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704392424] [2021-06-05 14:47:02,358 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:02,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:02,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:02,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:02,358 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 14:47:02,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:02,546 INFO L93 Difference]: Finished difference Result 333 states and 948 transitions. [2021-06-05 14:47:02,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:47:02,546 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 14:47:02,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:02,547 INFO L225 Difference]: With dead ends: 333 [2021-06-05 14:47:02,547 INFO L226 Difference]: Without dead ends: 314 [2021-06-05 14:47:02,547 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 178.2ms TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:47:02,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-06-05 14:47:02,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 212. [2021-06-05 14:47:02,549 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 14:47:02,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 617 transitions. [2021-06-05 14:47:02,549 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 617 transitions. Word has length 18 [2021-06-05 14:47:02,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:02,549 INFO L482 AbstractCegarLoop]: Abstraction has 212 states and 617 transitions. [2021-06-05 14:47:02,549 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 14:47:02,549 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 617 transitions. [2021-06-05 14:47:02,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:02,550 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:02,550 INFO L521 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 14:47:02,750 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 100 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable479 [2021-06-05 14:47:02,750 INFO L430 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:02,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:02,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1714954922, now seen corresponding path program 1 times [2021-06-05 14:47:02,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:02,750 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121468531] [2021-06-05 14:47:02,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:02,771 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 14:47:02,771 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:02,771 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121468531] [2021-06-05 14:47:02,771 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121468531] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:02,771 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386410312] [2021-06-05 14:47:02,771 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 14:47:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:02,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:02,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:02,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 14:47:02,837 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386410312] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:02,838 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:02,838 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:02,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473572954] [2021-06-05 14:47:02,838 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:02,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:02,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:02,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:02,838 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 14:47:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:02,901 INFO L93 Difference]: Finished difference Result 306 states and 874 transitions. [2021-06-05 14:47:02,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:02,902 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 14:47:02,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:02,902 INFO L225 Difference]: With dead ends: 306 [2021-06-05 14:47:02,902 INFO L226 Difference]: Without dead ends: 282 [2021-06-05 14:47:02,902 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 53.1ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:02,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-06-05 14:47:02,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 219. [2021-06-05 14:47:02,904 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 14:47:02,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 638 transitions. [2021-06-05 14:47:02,905 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 638 transitions. Word has length 19 [2021-06-05 14:47:02,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:02,905 INFO L482 AbstractCegarLoop]: Abstraction has 219 states and 638 transitions. [2021-06-05 14:47:02,905 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 14:47:02,905 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 638 transitions. [2021-06-05 14:47:02,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:02,905 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:02,905 INFO L521 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 14:47:03,106 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable482,101 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:03,106 INFO L430 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:03,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:03,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1799002545, now seen corresponding path program 1 times [2021-06-05 14:47:03,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:03,106 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210393611] [2021-06-05 14:47:03,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:03,131 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 14:47:03,131 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:03,131 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210393611] [2021-06-05 14:47:03,132 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210393611] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:03,132 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620094169] [2021-06-05 14:47:03,132 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 14:47:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:03,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:03,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:03,198 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 14:47:03,198 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620094169] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:03,198 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:03,198 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:47:03,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784645680] [2021-06-05 14:47:03,212 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:47:03,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:03,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:47:03,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:47:03,213 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 14:47:03,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:03,293 INFO L93 Difference]: Finished difference Result 359 states and 1037 transitions. [2021-06-05 14:47:03,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:03,293 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 14:47:03,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:03,294 INFO L225 Difference]: With dead ends: 359 [2021-06-05 14:47:03,294 INFO L226 Difference]: Without dead ends: 359 [2021-06-05 14:47:03,294 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 58.0ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:03,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-06-05 14:47:03,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 230. [2021-06-05 14:47:03,296 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 14:47:03,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 682 transitions. [2021-06-05 14:47:03,297 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 682 transitions. Word has length 19 [2021-06-05 14:47:03,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:03,297 INFO L482 AbstractCegarLoop]: Abstraction has 230 states and 682 transitions. [2021-06-05 14:47:03,297 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 14:47:03,297 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 682 transitions. [2021-06-05 14:47:03,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:03,297 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:03,297 INFO L521 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 14:47:03,504 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable485 [2021-06-05 14:47:03,505 INFO L430 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:03,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:03,505 INFO L82 PathProgramCache]: Analyzing trace with hash -2143819529, now seen corresponding path program 2 times [2021-06-05 14:47:03,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:03,505 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813453642] [2021-06-05 14:47:03,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:03,528 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 14:47:03,528 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:03,528 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813453642] [2021-06-05 14:47:03,528 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813453642] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:03,528 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608627540] [2021-06-05 14:47:03,528 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 14:47:03,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:03,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:03,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:03,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:03,591 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 14:47:03,591 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608627540] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:03,591 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:03,591 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:03,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087524571] [2021-06-05 14:47:03,592 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:03,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:03,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:03,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:03,592 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 14:47:03,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:03,668 INFO L93 Difference]: Finished difference Result 371 states and 1061 transitions. [2021-06-05 14:47:03,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:03,669 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 14:47:03,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:03,669 INFO L225 Difference]: With dead ends: 371 [2021-06-05 14:47:03,669 INFO L226 Difference]: Without dead ends: 363 [2021-06-05 14:47:03,669 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 54.0ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:03,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-06-05 14:47:03,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 246. [2021-06-05 14:47:03,672 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 14:47:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 738 transitions. [2021-06-05 14:47:03,672 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 738 transitions. Word has length 19 [2021-06-05 14:47:03,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:03,672 INFO L482 AbstractCegarLoop]: Abstraction has 246 states and 738 transitions. [2021-06-05 14:47:03,672 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 14:47:03,672 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 738 transitions. [2021-06-05 14:47:03,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:03,673 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:03,673 INFO L521 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 14:47:03,873 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable486 [2021-06-05 14:47:03,873 INFO L430 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:03,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:03,873 INFO L82 PathProgramCache]: Analyzing trace with hash -2111872576, now seen corresponding path program 2 times [2021-06-05 14:47:03,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:03,874 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096957208] [2021-06-05 14:47:03,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:03,905 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 14:47:03,905 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:03,905 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096957208] [2021-06-05 14:47:03,905 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096957208] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:03,905 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340650877] [2021-06-05 14:47:03,906 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 14:47:03,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:03,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:03,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:03,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:03,982 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 14:47:03,982 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340650877] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:03,982 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:03,982 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:03,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380901688] [2021-06-05 14:47:03,982 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:03,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:03,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:03,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:03,982 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 14:47:04,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:04,053 INFO L93 Difference]: Finished difference Result 360 states and 1044 transitions. [2021-06-05 14:47:04,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:04,054 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 14:47:04,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:04,054 INFO L225 Difference]: With dead ends: 360 [2021-06-05 14:47:04,054 INFO L226 Difference]: Without dead ends: 360 [2021-06-05 14:47:04,054 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 69.3ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:47:04,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-06-05 14:47:04,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 250. [2021-06-05 14:47:04,057 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 14:47:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 754 transitions. [2021-06-05 14:47:04,057 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 754 transitions. Word has length 19 [2021-06-05 14:47:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:04,057 INFO L482 AbstractCegarLoop]: Abstraction has 250 states and 754 transitions. [2021-06-05 14:47:04,057 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 14:47:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 754 transitions. [2021-06-05 14:47:04,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:04,058 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:04,058 INFO L521 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 14:47:04,258 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 104 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable489 [2021-06-05 14:47:04,258 INFO L430 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:04,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:04,258 INFO L82 PathProgramCache]: Analyzing trace with hash 311126640, now seen corresponding path program 3 times [2021-06-05 14:47:04,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:04,259 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712916436] [2021-06-05 14:47:04,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:04,282 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 14:47:04,282 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:04,282 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712916436] [2021-06-05 14:47:04,282 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712916436] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:04,282 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294099677] [2021-06-05 14:47:04,282 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 14:47:04,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:47:04,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:04,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:04,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:04,350 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 14:47:04,350 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294099677] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:04,350 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:04,350 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:04,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610287797] [2021-06-05 14:47:04,350 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:04,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:04,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:04,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:04,351 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 14:47:04,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:04,422 INFO L93 Difference]: Finished difference Result 330 states and 966 transitions. [2021-06-05 14:47:04,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:04,422 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 14:47:04,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:04,423 INFO L225 Difference]: With dead ends: 330 [2021-06-05 14:47:04,423 INFO L226 Difference]: Without dead ends: 321 [2021-06-05 14:47:04,423 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 63.0ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:47:04,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-06-05 14:47:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 250. [2021-06-05 14:47:04,425 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 14:47:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 750 transitions. [2021-06-05 14:47:04,425 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 750 transitions. Word has length 19 [2021-06-05 14:47:04,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:04,426 INFO L482 AbstractCegarLoop]: Abstraction has 250 states and 750 transitions. [2021-06-05 14:47:04,426 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 14:47:04,426 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 750 transitions. [2021-06-05 14:47:04,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:04,426 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:04,426 INFO L521 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 14:47:04,626 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 105 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable490 [2021-06-05 14:47:04,626 INFO L430 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:04,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:04,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1664534853, now seen corresponding path program 3 times [2021-06-05 14:47:04,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:04,627 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973422538] [2021-06-05 14:47:04,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:04,651 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 14:47:04,651 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:04,651 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973422538] [2021-06-05 14:47:04,651 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973422538] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:04,651 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688275375] [2021-06-05 14:47:04,651 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 14:47:04,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:47:04,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:04,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:04,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:04,713 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 14:47:04,713 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688275375] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:04,713 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:04,713 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:04,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039327296] [2021-06-05 14:47:04,713 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:04,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:04,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:04,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:04,714 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 14:47:04,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:04,793 INFO L93 Difference]: Finished difference Result 351 states and 1024 transitions. [2021-06-05 14:47:04,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:04,794 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 14:47:04,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:04,794 INFO L225 Difference]: With dead ends: 351 [2021-06-05 14:47:04,794 INFO L226 Difference]: Without dead ends: 351 [2021-06-05 14:47:04,794 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 56.9ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:04,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2021-06-05 14:47:04,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 238. [2021-06-05 14:47:04,797 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 14:47:04,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 710 transitions. [2021-06-05 14:47:04,797 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 710 transitions. Word has length 19 [2021-06-05 14:47:04,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:04,797 INFO L482 AbstractCegarLoop]: Abstraction has 238 states and 710 transitions. [2021-06-05 14:47:04,797 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 14:47:04,797 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 710 transitions. [2021-06-05 14:47:04,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:04,797 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:04,797 INFO L521 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 14:47:04,998 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable493,106 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:04,998 INFO L430 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:04,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:04,998 INFO L82 PathProgramCache]: Analyzing trace with hash -757034203, now seen corresponding path program 4 times [2021-06-05 14:47:04,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:04,998 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765675364] [2021-06-05 14:47:04,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:05,021 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 14:47:05,022 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:05,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765675364] [2021-06-05 14:47:05,022 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765675364] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:05,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835929858] [2021-06-05 14:47:05,022 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 14:47:05,057 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:47:05,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:05,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:05,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:05,093 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 14:47:05,093 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835929858] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:05,093 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:05,093 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:05,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755517633] [2021-06-05 14:47:05,093 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:05,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:05,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:05,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:05,094 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 14:47:05,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:05,164 INFO L93 Difference]: Finished difference Result 321 states and 937 transitions. [2021-06-05 14:47:05,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:05,165 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 14:47:05,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:05,165 INFO L225 Difference]: With dead ends: 321 [2021-06-05 14:47:05,165 INFO L226 Difference]: Without dead ends: 305 [2021-06-05 14:47:05,165 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 51.2ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:05,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-06-05 14:47:05,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 242. [2021-06-05 14:47:05,167 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 14:47:05,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 722 transitions. [2021-06-05 14:47:05,168 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 722 transitions. Word has length 19 [2021-06-05 14:47:05,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:05,168 INFO L482 AbstractCegarLoop]: Abstraction has 242 states and 722 transitions. [2021-06-05 14:47:05,168 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 14:47:05,168 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 722 transitions. [2021-06-05 14:47:05,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:05,168 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:05,168 INFO L521 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 14:47:05,368 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable494,107 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:05,369 INFO L430 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:05,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:05,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1495725994, now seen corresponding path program 4 times [2021-06-05 14:47:05,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:05,369 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268906649] [2021-06-05 14:47:05,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:05,401 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 14:47:05,401 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:05,401 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268906649] [2021-06-05 14:47:05,401 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268906649] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:05,401 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534525438] [2021-06-05 14:47:05,401 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 14:47:05,426 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:47:05,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:05,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:05,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:05,465 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 14:47:05,465 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534525438] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:05,465 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:05,465 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:47:05,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746125607] [2021-06-05 14:47:05,465 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:47:05,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:05,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:47:05,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:47:05,465 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 14:47:05,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:05,540 INFO L93 Difference]: Finished difference Result 379 states and 1110 transitions. [2021-06-05 14:47:05,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:05,540 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 14:47:05,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:05,541 INFO L225 Difference]: With dead ends: 379 [2021-06-05 14:47:05,541 INFO L226 Difference]: Without dead ends: 379 [2021-06-05 14:47:05,541 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 51.9ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:05,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-06-05 14:47:05,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 246. [2021-06-05 14:47:05,544 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 14:47:05,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 738 transitions. [2021-06-05 14:47:05,544 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 738 transitions. Word has length 19 [2021-06-05 14:47:05,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:05,544 INFO L482 AbstractCegarLoop]: Abstraction has 246 states and 738 transitions. [2021-06-05 14:47:05,544 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 14:47:05,544 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 738 transitions. [2021-06-05 14:47:05,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:05,544 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:05,544 INFO L521 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 14:47:05,745 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 108 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable497 [2021-06-05 14:47:05,745 INFO L430 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:05,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:05,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1556074207, now seen corresponding path program 5 times [2021-06-05 14:47:05,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:05,745 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519260642] [2021-06-05 14:47:05,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:05,770 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 14:47:05,771 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:05,771 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519260642] [2021-06-05 14:47:05,771 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519260642] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:05,771 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290934226] [2021-06-05 14:47:05,771 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 14:47:05,796 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:05,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:05,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:05,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:05,839 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 14:47:05,840 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290934226] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:05,840 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:05,840 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:05,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926023800] [2021-06-05 14:47:05,852 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:05,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:05,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:05,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:05,853 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 14:47:05,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:05,926 INFO L93 Difference]: Finished difference Result 372 states and 1080 transitions. [2021-06-05 14:47:05,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:05,926 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 14:47:05,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:05,927 INFO L225 Difference]: With dead ends: 372 [2021-06-05 14:47:05,927 INFO L226 Difference]: Without dead ends: 364 [2021-06-05 14:47:05,927 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 62.4ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:47:05,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-06-05 14:47:05,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 262. [2021-06-05 14:47:05,929 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 14:47:05,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 794 transitions. [2021-06-05 14:47:05,930 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 794 transitions. Word has length 19 [2021-06-05 14:47:05,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:05,930 INFO L482 AbstractCegarLoop]: Abstraction has 262 states and 794 transitions. [2021-06-05 14:47:05,930 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 14:47:05,930 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 794 transitions. [2021-06-05 14:47:05,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:05,930 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:05,930 INFO L521 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 14:47:06,131 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 109 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable498 [2021-06-05 14:47:06,131 INFO L430 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:06,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:06,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1524127254, now seen corresponding path program 5 times [2021-06-05 14:47:06,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:06,131 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707894861] [2021-06-05 14:47:06,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:06,155 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 14:47:06,155 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:06,155 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707894861] [2021-06-05 14:47:06,155 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707894861] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:06,155 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623564521] [2021-06-05 14:47:06,155 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 14:47:06,180 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:06,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:06,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:06,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:06,217 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 14:47:06,217 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623564521] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:06,217 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:06,217 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:06,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175191680] [2021-06-05 14:47:06,217 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:06,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:06,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:06,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:06,217 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 14:47:06,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:06,299 INFO L93 Difference]: Finished difference Result 408 states and 1192 transitions. [2021-06-05 14:47:06,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:06,300 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 14:47:06,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:06,300 INFO L225 Difference]: With dead ends: 408 [2021-06-05 14:47:06,300 INFO L226 Difference]: Without dead ends: 408 [2021-06-05 14:47:06,300 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 57.0ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:06,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-06-05 14:47:06,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 262. [2021-06-05 14:47:06,303 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 14:47:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 794 transitions. [2021-06-05 14:47:06,303 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 794 transitions. Word has length 19 [2021-06-05 14:47:06,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:06,304 INFO L482 AbstractCegarLoop]: Abstraction has 262 states and 794 transitions. [2021-06-05 14:47:06,304 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 14:47:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 794 transitions. [2021-06-05 14:47:06,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:06,304 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:06,304 INFO L521 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 14:47:06,504 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable501 [2021-06-05 14:47:06,504 INFO L430 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:06,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:06,505 INFO L82 PathProgramCache]: Analyzing trace with hash 898871962, now seen corresponding path program 6 times [2021-06-05 14:47:06,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:06,505 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683917287] [2021-06-05 14:47:06,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:06,527 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 14:47:06,527 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:06,528 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683917287] [2021-06-05 14:47:06,528 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683917287] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:06,528 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884757049] [2021-06-05 14:47:06,528 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 14:47:06,552 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:47:06,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:06,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:06,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:06,596 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 14:47:06,597 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884757049] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:06,597 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:06,597 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:06,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677361517] [2021-06-05 14:47:06,597 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:06,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:06,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:06,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:06,597 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 14:47:06,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:06,672 INFO L93 Difference]: Finished difference Result 354 states and 1042 transitions. [2021-06-05 14:47:06,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:06,672 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 14:47:06,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:06,673 INFO L225 Difference]: With dead ends: 354 [2021-06-05 14:47:06,673 INFO L226 Difference]: Without dead ends: 345 [2021-06-05 14:47:06,673 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 56.5ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:06,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-06-05 14:47:06,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 262. [2021-06-05 14:47:06,675 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 14:47:06,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 790 transitions. [2021-06-05 14:47:06,676 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 790 transitions. Word has length 19 [2021-06-05 14:47:06,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:06,676 INFO L482 AbstractCegarLoop]: Abstraction has 262 states and 790 transitions. [2021-06-05 14:47:06,676 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 14:47:06,676 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 790 transitions. [2021-06-05 14:47:06,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:06,676 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:06,676 INFO L521 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 14:47:06,876 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable502,111 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:06,877 INFO L430 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:06,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:06,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1076789531, now seen corresponding path program 6 times [2021-06-05 14:47:06,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:06,877 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516216694] [2021-06-05 14:47:06,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:06,905 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 14:47:06,905 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:06,905 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516216694] [2021-06-05 14:47:06,905 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516216694] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:06,905 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515441505] [2021-06-05 14:47:06,905 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 14:47:06,933 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:47:06,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:06,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:06,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:07,001 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 14:47:07,001 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515441505] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:07,001 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:07,001 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:07,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997055695] [2021-06-05 14:47:07,001 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:07,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:07,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:07,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:07,002 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 14:47:07,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:07,081 INFO L93 Difference]: Finished difference Result 326 states and 967 transitions. [2021-06-05 14:47:07,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:07,082 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 14:47:07,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:07,082 INFO L225 Difference]: With dead ends: 326 [2021-06-05 14:47:07,082 INFO L226 Difference]: Without dead ends: 326 [2021-06-05 14:47:07,084 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 69.3ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:47:07,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-06-05 14:47:07,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 246. [2021-06-05 14:47:07,095 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 14:47:07,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 738 transitions. [2021-06-05 14:47:07,096 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 738 transitions. Word has length 19 [2021-06-05 14:47:07,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:07,096 INFO L482 AbstractCegarLoop]: Abstraction has 246 states and 738 transitions. [2021-06-05 14:47:07,096 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 14:47:07,096 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 738 transitions. [2021-06-05 14:47:07,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:07,096 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:07,096 INFO L521 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 14:47:07,297 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable505 [2021-06-05 14:47:07,297 INFO L430 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:07,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:07,297 INFO L82 PathProgramCache]: Analyzing trace with hash 132155580, now seen corresponding path program 7 times [2021-06-05 14:47:07,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:07,297 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406352826] [2021-06-05 14:47:07,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:07,320 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 14:47:07,320 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:07,320 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406352826] [2021-06-05 14:47:07,320 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406352826] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:07,320 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154313130] [2021-06-05 14:47:07,321 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 14:47:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:07,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:07,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:07,386 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 14:47:07,387 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154313130] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:07,387 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:07,387 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:07,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308206349] [2021-06-05 14:47:07,387 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:07,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:07,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:07,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:07,387 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 14:47:07,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:07,456 INFO L93 Difference]: Finished difference Result 492 states and 1411 transitions. [2021-06-05 14:47:07,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:07,456 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 14:47:07,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:07,457 INFO L225 Difference]: With dead ends: 492 [2021-06-05 14:47:07,457 INFO L226 Difference]: Without dead ends: 468 [2021-06-05 14:47:07,457 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 55.2ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:07,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-06-05 14:47:07,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 255. [2021-06-05 14:47:07,460 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 14:47:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 767 transitions. [2021-06-05 14:47:07,460 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 767 transitions. Word has length 19 [2021-06-05 14:47:07,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:07,461 INFO L482 AbstractCegarLoop]: Abstraction has 255 states and 767 transitions. [2021-06-05 14:47:07,461 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 14:47:07,461 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 767 transitions. [2021-06-05 14:47:07,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:07,461 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:07,461 INFO L521 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 14:47:07,661 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable506,113 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:07,661 INFO L430 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:07,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:07,662 INFO L82 PathProgramCache]: Analyzing trace with hash 48107957, now seen corresponding path program 7 times [2021-06-05 14:47:07,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:07,662 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523901506] [2021-06-05 14:47:07,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:07,686 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 14:47:07,686 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:07,686 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523901506] [2021-06-05 14:47:07,686 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523901506] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:07,686 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972249219] [2021-06-05 14:47:07,686 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 14:47:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:07,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:07,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:07,745 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 14:47:07,745 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972249219] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:07,745 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:07,745 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:47:07,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868687158] [2021-06-05 14:47:07,745 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:47:07,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:07,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:47:07,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:47:07,746 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 14:47:07,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:07,820 INFO L93 Difference]: Finished difference Result 608 states and 1788 transitions. [2021-06-05 14:47:07,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:07,820 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 14:47:07,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:07,821 INFO L225 Difference]: With dead ends: 608 [2021-06-05 14:47:07,821 INFO L226 Difference]: Without dead ends: 608 [2021-06-05 14:47:07,821 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 46.8ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:07,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2021-06-05 14:47:07,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 264. [2021-06-05 14:47:07,824 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 14:47:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 803 transitions. [2021-06-05 14:47:07,825 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 803 transitions. Word has length 19 [2021-06-05 14:47:07,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:07,825 INFO L482 AbstractCegarLoop]: Abstraction has 264 states and 803 transitions. [2021-06-05 14:47:07,825 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 14:47:07,825 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 803 transitions. [2021-06-05 14:47:07,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:07,825 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:07,825 INFO L521 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 14:47:08,042 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable509,114 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:08,042 INFO L430 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:08,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:08,042 INFO L82 PathProgramCache]: Analyzing trace with hash -296709027, now seen corresponding path program 8 times [2021-06-05 14:47:08,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:08,042 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551625150] [2021-06-05 14:47:08,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:08,065 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 14:47:08,065 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:08,065 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551625150] [2021-06-05 14:47:08,065 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551625150] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:08,065 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534681400] [2021-06-05 14:47:08,065 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 14:47:08,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:08,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:08,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:08,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:08,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 14:47:08,130 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534681400] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:08,130 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:08,131 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:08,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664090520] [2021-06-05 14:47:08,131 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:08,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:08,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:08,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:08,131 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 14:47:08,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:08,205 INFO L93 Difference]: Finished difference Result 554 states and 1618 transitions. [2021-06-05 14:47:08,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:08,205 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 14:47:08,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:08,206 INFO L225 Difference]: With dead ends: 554 [2021-06-05 14:47:08,206 INFO L226 Difference]: Without dead ends: 546 [2021-06-05 14:47:08,206 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 49.5ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:08,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2021-06-05 14:47:08,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 280. [2021-06-05 14:47:08,209 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 14:47:08,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 859 transitions. [2021-06-05 14:47:08,209 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 859 transitions. Word has length 19 [2021-06-05 14:47:08,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:08,209 INFO L482 AbstractCegarLoop]: Abstraction has 280 states and 859 transitions. [2021-06-05 14:47:08,210 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 14:47:08,210 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 859 transitions. [2021-06-05 14:47:08,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:08,210 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:08,210 INFO L521 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 14:47:08,410 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable510,115 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:08,410 INFO L430 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:08,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:08,411 INFO L82 PathProgramCache]: Analyzing trace with hash -264762074, now seen corresponding path program 8 times [2021-06-05 14:47:08,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:08,411 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047614548] [2021-06-05 14:47:08,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:08,442 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 14:47:08,442 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:08,442 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047614548] [2021-06-05 14:47:08,442 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047614548] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:08,442 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119078439] [2021-06-05 14:47:08,442 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 14:47:08,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:08,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:08,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:08,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:08,518 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 14:47:08,519 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119078439] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:08,519 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:08,519 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:08,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698229179] [2021-06-05 14:47:08,519 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:08,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:08,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:08,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:08,519 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 14:47:08,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:08,600 INFO L93 Difference]: Finished difference Result 521 states and 1530 transitions. [2021-06-05 14:47:08,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:08,600 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 14:47:08,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:08,601 INFO L225 Difference]: With dead ends: 521 [2021-06-05 14:47:08,601 INFO L226 Difference]: Without dead ends: 521 [2021-06-05 14:47:08,601 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 72.6ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:47:08,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-06-05 14:47:08,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 280. [2021-06-05 14:47:08,604 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 14:47:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 859 transitions. [2021-06-05 14:47:08,605 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 859 transitions. Word has length 19 [2021-06-05 14:47:08,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:08,605 INFO L482 AbstractCegarLoop]: Abstraction has 280 states and 859 transitions. [2021-06-05 14:47:08,605 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 14:47:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 859 transitions. [2021-06-05 14:47:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:08,605 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:08,605 INFO L521 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 14:47:08,806 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable513 [2021-06-05 14:47:08,806 INFO L430 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:08,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:08,806 INFO L82 PathProgramCache]: Analyzing trace with hash -2136730154, now seen corresponding path program 9 times [2021-06-05 14:47:08,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:08,806 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380914167] [2021-06-05 14:47:08,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:08,834 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 14:47:08,834 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:08,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380914167] [2021-06-05 14:47:08,834 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380914167] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:08,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145171048] [2021-06-05 14:47:08,834 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 14:47:08,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:47:08,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:08,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:08,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:08,912 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 14:47:08,913 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145171048] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:08,913 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:08,913 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:08,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334422711] [2021-06-05 14:47:08,913 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:08,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:08,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:08,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:08,913 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 14:47:09,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:09,002 INFO L93 Difference]: Finished difference Result 518 states and 1507 transitions. [2021-06-05 14:47:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:09,002 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 14:47:09,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:09,003 INFO L225 Difference]: With dead ends: 518 [2021-06-05 14:47:09,003 INFO L226 Difference]: Without dead ends: 509 [2021-06-05 14:47:09,003 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 70.2ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:47:09,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2021-06-05 14:47:09,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 280. [2021-06-05 14:47:09,006 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 14:47:09,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 855 transitions. [2021-06-05 14:47:09,007 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 855 transitions. Word has length 19 [2021-06-05 14:47:09,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:09,007 INFO L482 AbstractCegarLoop]: Abstraction has 280 states and 855 transitions. [2021-06-05 14:47:09,007 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 14:47:09,007 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 855 transitions. [2021-06-05 14:47:09,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:09,007 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:09,007 INFO L521 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 14:47:09,212 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable514,117 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:09,213 INFO L430 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:09,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:09,213 INFO L82 PathProgramCache]: Analyzing trace with hash 182575649, now seen corresponding path program 9 times [2021-06-05 14:47:09,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:09,213 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569312207] [2021-06-05 14:47:09,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:09,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 14:47:09,238 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:09,238 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569312207] [2021-06-05 14:47:09,238 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569312207] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:09,238 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668124485] [2021-06-05 14:47:09,238 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 14:47:09,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:47:09,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:09,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:09,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:09,300 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 14:47:09,300 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668124485] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:09,300 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:09,300 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:09,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485560895] [2021-06-05 14:47:09,300 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:09,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:09,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:09,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:09,300 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 14:47:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:09,370 INFO L93 Difference]: Finished difference Result 572 states and 1674 transitions. [2021-06-05 14:47:09,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:09,371 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 14:47:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:09,371 INFO L225 Difference]: With dead ends: 572 [2021-06-05 14:47:09,371 INFO L226 Difference]: Without dead ends: 572 [2021-06-05 14:47:09,371 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 53.7ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:09,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-06-05 14:47:09,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 269. [2021-06-05 14:47:09,375 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 14:47:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 822 transitions. [2021-06-05 14:47:09,375 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 822 transitions. Word has length 19 [2021-06-05 14:47:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:09,375 INFO L482 AbstractCegarLoop]: Abstraction has 269 states and 822 transitions. [2021-06-05 14:47:09,375 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 14:47:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 822 transitions. [2021-06-05 14:47:09,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:09,375 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:09,376 INFO L521 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 14:47:09,581 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable517,118 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:09,581 INFO L430 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:09,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:09,581 INFO L82 PathProgramCache]: Analyzing trace with hash -12394796, now seen corresponding path program 10 times [2021-06-05 14:47:09,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:09,581 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25914404] [2021-06-05 14:47:09,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:09,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 14:47:09,605 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:09,605 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25914404] [2021-06-05 14:47:09,605 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25914404] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:09,605 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:09,605 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:09,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589884827] [2021-06-05 14:47:09,606 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:09,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:09,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:09,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:09,606 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 14:47:09,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:09,683 INFO L93 Difference]: Finished difference Result 413 states and 1194 transitions. [2021-06-05 14:47:09,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:09,683 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 14:47:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:09,684 INFO L225 Difference]: With dead ends: 413 [2021-06-05 14:47:09,684 INFO L226 Difference]: Without dead ends: 389 [2021-06-05 14:47:09,684 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 56.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:09,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-06-05 14:47:09,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 273. [2021-06-05 14:47:09,686 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 14:47:09,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 828 transitions. [2021-06-05 14:47:09,687 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 828 transitions. Word has length 19 [2021-06-05 14:47:09,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:09,687 INFO L482 AbstractCegarLoop]: Abstraction has 273 states and 828 transitions. [2021-06-05 14:47:09,687 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 14:47:09,687 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 828 transitions. [2021-06-05 14:47:09,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:09,687 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:09,687 INFO L521 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 14:47:09,687 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable518 [2021-06-05 14:47:09,687 INFO L430 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:09,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:09,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1941255398, now seen corresponding path program 11 times [2021-06-05 14:47:09,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:09,688 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486958517] [2021-06-05 14:47:09,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:09,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 14:47:09,711 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:09,711 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486958517] [2021-06-05 14:47:09,711 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486958517] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:09,711 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:09,711 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:09,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642431708] [2021-06-05 14:47:09,712 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:09,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:09,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:09,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:09,712 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 14:47:09,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:09,795 INFO L93 Difference]: Finished difference Result 397 states and 1148 transitions. [2021-06-05 14:47:09,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:09,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 14:47:09,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:09,795 INFO L225 Difference]: With dead ends: 397 [2021-06-05 14:47:09,795 INFO L226 Difference]: Without dead ends: 391 [2021-06-05 14:47:09,795 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 64.6ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:09,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-06-05 14:47:09,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 283. [2021-06-05 14:47:09,798 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 14:47:09,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 853 transitions. [2021-06-05 14:47:09,799 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 853 transitions. Word has length 19 [2021-06-05 14:47:09,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:09,799 INFO L482 AbstractCegarLoop]: Abstraction has 283 states and 853 transitions. [2021-06-05 14:47:09,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 14:47:09,799 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 853 transitions. [2021-06-05 14:47:09,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:09,799 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:09,799 INFO L521 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 14:47:09,799 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable519 [2021-06-05 14:47:09,799 INFO L430 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:09,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:09,800 INFO L82 PathProgramCache]: Analyzing trace with hash -449594866, now seen corresponding path program 12 times [2021-06-05 14:47:09,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:09,800 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598174368] [2021-06-05 14:47:09,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:09,825 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 14:47:09,825 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:09,825 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598174368] [2021-06-05 14:47:09,825 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598174368] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:09,825 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:09,825 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:09,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079042044] [2021-06-05 14:47:09,825 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:09,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:09,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:09,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:09,825 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 14:47:09,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:09,915 INFO L93 Difference]: Finished difference Result 361 states and 1065 transitions. [2021-06-05 14:47:09,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:09,916 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 14:47:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:09,916 INFO L225 Difference]: With dead ends: 361 [2021-06-05 14:47:09,916 INFO L226 Difference]: Without dead ends: 346 [2021-06-05 14:47:09,916 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 70.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:09,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-06-05 14:47:09,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 269. [2021-06-05 14:47:09,919 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 14:47:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 820 transitions. [2021-06-05 14:47:09,919 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 820 transitions. Word has length 19 [2021-06-05 14:47:09,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:09,919 INFO L482 AbstractCegarLoop]: Abstraction has 269 states and 820 transitions. [2021-06-05 14:47:09,919 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 14:47:09,919 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 820 transitions. [2021-06-05 14:47:09,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:09,920 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:09,920 INFO L521 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 14:47:09,920 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable520 [2021-06-05 14:47:09,920 INFO L430 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:09,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:09,920 INFO L82 PathProgramCache]: Analyzing trace with hash -405487539, now seen corresponding path program 10 times [2021-06-05 14:47:09,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:09,920 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586562577] [2021-06-05 14:47:09,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:09,943 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 14:47:09,944 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:09,944 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586562577] [2021-06-05 14:47:09,944 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586562577] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:09,944 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367184602] [2021-06-05 14:47:09,944 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 14:47:09,968 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:47:09,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:09,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:09,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:09,999 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 14:47:10,000 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367184602] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:10,000 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:10,000 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:47:10,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004274735] [2021-06-05 14:47:10,000 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:47:10,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:10,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:47:10,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:47:10,000 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 14:47:10,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:10,075 INFO L93 Difference]: Finished difference Result 531 states and 1547 transitions. [2021-06-05 14:47:10,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:10,076 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 14:47:10,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:10,076 INFO L225 Difference]: With dead ends: 531 [2021-06-05 14:47:10,076 INFO L226 Difference]: Without dead ends: 531 [2021-06-05 14:47:10,077 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 45.8ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:10,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2021-06-05 14:47:10,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 254. [2021-06-05 14:47:10,079 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 14:47:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 762 transitions. [2021-06-05 14:47:10,080 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 762 transitions. Word has length 19 [2021-06-05 14:47:10,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:10,080 INFO L482 AbstractCegarLoop]: Abstraction has 254 states and 762 transitions. [2021-06-05 14:47:10,080 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 14:47:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 762 transitions. [2021-06-05 14:47:10,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:10,080 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:10,080 INFO L521 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 14:47:10,281 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable521 [2021-06-05 14:47:10,281 INFO L430 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:10,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:10,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1305660447, now seen corresponding path program 11 times [2021-06-05 14:47:10,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:10,281 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874706936] [2021-06-05 14:47:10,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:10,304 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 14:47:10,305 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:10,305 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874706936] [2021-06-05 14:47:10,305 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874706936] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:10,305 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691201730] [2021-06-05 14:47:10,305 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 14:47:10,333 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:10,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:10,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:10,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:10,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 14:47:10,372 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691201730] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:10,372 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:10,372 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:10,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857633550] [2021-06-05 14:47:10,373 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:10,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:10,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:10,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:10,373 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 14:47:10,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:10,454 INFO L93 Difference]: Finished difference Result 470 states and 1356 transitions. [2021-06-05 14:47:10,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:10,455 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 14:47:10,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:10,455 INFO L225 Difference]: With dead ends: 470 [2021-06-05 14:47:10,455 INFO L226 Difference]: Without dead ends: 464 [2021-06-05 14:47:10,455 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 57.9ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:10,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-06-05 14:47:10,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 266. [2021-06-05 14:47:10,458 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 14:47:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 801 transitions. [2021-06-05 14:47:10,459 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 801 transitions. Word has length 19 [2021-06-05 14:47:10,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:10,459 INFO L482 AbstractCegarLoop]: Abstraction has 266 states and 801 transitions. [2021-06-05 14:47:10,459 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 14:47:10,459 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 801 transitions. [2021-06-05 14:47:10,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:10,459 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:10,459 INFO L521 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 14:47:10,664 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable522,120 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:10,665 INFO L430 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:10,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:10,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1773947229, now seen corresponding path program 12 times [2021-06-05 14:47:10,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:10,665 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028512125] [2021-06-05 14:47:10,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:10,690 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 14:47:10,690 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:10,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028512125] [2021-06-05 14:47:10,690 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028512125] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:10,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146726706] [2021-06-05 14:47:10,690 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 14:47:10,714 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:47:10,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:10,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:10,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:10,753 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 14:47:10,753 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146726706] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:10,753 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:10,753 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:10,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286365586] [2021-06-05 14:47:10,753 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:10,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:10,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:10,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:10,754 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 14:47:10,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:10,824 INFO L93 Difference]: Finished difference Result 448 states and 1309 transitions. [2021-06-05 14:47:10,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:10,825 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 14:47:10,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:10,825 INFO L225 Difference]: With dead ends: 448 [2021-06-05 14:47:10,826 INFO L226 Difference]: Without dead ends: 448 [2021-06-05 14:47:10,826 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 53.9ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:10,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-06-05 14:47:10,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 251. [2021-06-05 14:47:10,828 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 14:47:10,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 756 transitions. [2021-06-05 14:47:10,829 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 756 transitions. Word has length 19 [2021-06-05 14:47:10,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:10,829 INFO L482 AbstractCegarLoop]: Abstraction has 251 states and 756 transitions. [2021-06-05 14:47:10,829 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 14:47:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 756 transitions. [2021-06-05 14:47:10,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:10,829 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:10,829 INFO L521 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 14:47:11,030 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable525,121 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:11,030 INFO L430 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:11,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:11,030 INFO L82 PathProgramCache]: Analyzing trace with hash -964970507, now seen corresponding path program 13 times [2021-06-05 14:47:11,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:11,030 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35001292] [2021-06-05 14:47:11,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:11,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 14:47:11,056 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:11,056 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35001292] [2021-06-05 14:47:11,056 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35001292] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:11,056 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:11,057 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:11,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213896554] [2021-06-05 14:47:11,057 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:11,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:11,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:11,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:11,057 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 14:47:11,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:11,120 INFO L93 Difference]: Finished difference Result 469 states and 1343 transitions. [2021-06-05 14:47:11,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:11,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 14:47:11,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:11,121 INFO L225 Difference]: With dead ends: 469 [2021-06-05 14:47:11,121 INFO L226 Difference]: Without dead ends: 461 [2021-06-05 14:47:11,121 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 39.1ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:11,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-06-05 14:47:11,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 271. [2021-06-05 14:47:11,124 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 14:47:11,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 822 transitions. [2021-06-05 14:47:11,124 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 822 transitions. Word has length 19 [2021-06-05 14:47:11,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:11,124 INFO L482 AbstractCegarLoop]: Abstraction has 271 states and 822 transitions. [2021-06-05 14:47:11,124 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 14:47:11,124 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 822 transitions. [2021-06-05 14:47:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:11,125 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:11,125 INFO L521 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 14:47:11,125 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable526 [2021-06-05 14:47:11,125 INFO L430 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:11,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:11,125 INFO L82 PathProgramCache]: Analyzing trace with hash -584232867, now seen corresponding path program 14 times [2021-06-05 14:47:11,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:11,125 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253861468] [2021-06-05 14:47:11,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:11,162 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 14:47:11,162 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:11,162 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253861468] [2021-06-05 14:47:11,162 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253861468] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:11,162 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:11,162 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:11,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742599347] [2021-06-05 14:47:11,162 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:11,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:11,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:11,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:11,163 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 14:47:11,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:11,238 INFO L93 Difference]: Finished difference Result 475 states and 1358 transitions. [2021-06-05 14:47:11,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:11,238 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 14:47:11,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:11,239 INFO L225 Difference]: With dead ends: 475 [2021-06-05 14:47:11,239 INFO L226 Difference]: Without dead ends: 467 [2021-06-05 14:47:11,239 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 54.9ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:11,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2021-06-05 14:47:11,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 275. [2021-06-05 14:47:11,242 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 14:47:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 831 transitions. [2021-06-05 14:47:11,243 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 831 transitions. Word has length 19 [2021-06-05 14:47:11,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:11,243 INFO L482 AbstractCegarLoop]: Abstraction has 275 states and 831 transitions. [2021-06-05 14:47:11,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 14:47:11,243 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 831 transitions. [2021-06-05 14:47:11,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:11,243 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:11,243 INFO L521 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 14:47:11,243 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable527 [2021-06-05 14:47:11,243 INFO L430 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:11,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:11,243 INFO L82 PathProgramCache]: Analyzing trace with hash 967392422, now seen corresponding path program 13 times [2021-06-05 14:47:11,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:11,244 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623244995] [2021-06-05 14:47:11,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:11,272 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 14:47:11,272 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:11,272 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623244995] [2021-06-05 14:47:11,272 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623244995] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:11,272 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049884579] [2021-06-05 14:47:11,272 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 14:47:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:11,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:11,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:11,356 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 14:47:11,356 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049884579] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:11,356 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:11,356 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:11,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529173237] [2021-06-05 14:47:11,356 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:11,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:11,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:11,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:11,357 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 14:47:11,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:11,427 INFO L93 Difference]: Finished difference Result 493 states and 1439 transitions. [2021-06-05 14:47:11,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:11,428 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 14:47:11,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:11,428 INFO L225 Difference]: With dead ends: 493 [2021-06-05 14:47:11,428 INFO L226 Difference]: Without dead ends: 493 [2021-06-05 14:47:11,428 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 73.4ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:11,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2021-06-05 14:47:11,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 281. [2021-06-05 14:47:11,431 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 14:47:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 858 transitions. [2021-06-05 14:47:11,432 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 858 transitions. Word has length 19 [2021-06-05 14:47:11,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:11,432 INFO L482 AbstractCegarLoop]: Abstraction has 281 states and 858 transitions. [2021-06-05 14:47:11,432 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 14:47:11,432 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 858 transitions. [2021-06-05 14:47:11,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:11,432 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:11,432 INFO L521 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 14:47:11,633 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 122 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable528 [2021-06-05 14:47:11,633 INFO L430 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:11,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:11,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1897553598, now seen corresponding path program 14 times [2021-06-05 14:47:11,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:11,633 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933720598] [2021-06-05 14:47:11,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:11,658 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 14:47:11,659 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:11,659 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933720598] [2021-06-05 14:47:11,659 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933720598] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:11,659 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176832082] [2021-06-05 14:47:11,659 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 14:47:11,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:11,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:11,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:11,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:11,744 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 14:47:11,744 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176832082] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:11,744 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:11,744 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:11,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304864086] [2021-06-05 14:47:11,745 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:11,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:11,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:11,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:11,746 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 14:47:11,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:11,813 INFO L93 Difference]: Finished difference Result 475 states and 1370 transitions. [2021-06-05 14:47:11,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:11,813 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 14:47:11,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:11,814 INFO L225 Difference]: With dead ends: 475 [2021-06-05 14:47:11,814 INFO L226 Difference]: Without dead ends: 469 [2021-06-05 14:47:11,814 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 64.7ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:11,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2021-06-05 14:47:11,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 281. [2021-06-05 14:47:11,817 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 14:47:11,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 857 transitions. [2021-06-05 14:47:11,817 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 857 transitions. Word has length 19 [2021-06-05 14:47:11,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:11,817 INFO L482 AbstractCegarLoop]: Abstraction has 281 states and 857 transitions. [2021-06-05 14:47:11,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 14:47:11,818 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 857 transitions. [2021-06-05 14:47:11,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:11,818 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:11,818 INFO L521 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 14:47:12,018 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable529,123 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:12,018 INFO L430 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:12,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:12,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1169104647, now seen corresponding path program 15 times [2021-06-05 14:47:12,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:12,019 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738950161] [2021-06-05 14:47:12,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:12,043 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 14:47:12,044 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:12,044 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738950161] [2021-06-05 14:47:12,044 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738950161] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:12,044 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587894314] [2021-06-05 14:47:12,044 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 14:47:12,071 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:47:12,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:12,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:12,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:12,114 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 14:47:12,114 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587894314] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:12,114 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:12,114 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:12,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820502572] [2021-06-05 14:47:12,115 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:12,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:12,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:12,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:12,115 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 14:47:12,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:12,186 INFO L93 Difference]: Finished difference Result 494 states and 1409 transitions. [2021-06-05 14:47:12,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:12,186 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 14:47:12,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:12,187 INFO L225 Difference]: With dead ends: 494 [2021-06-05 14:47:12,187 INFO L226 Difference]: Without dead ends: 486 [2021-06-05 14:47:12,187 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 52.6ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:12,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2021-06-05 14:47:12,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 281. [2021-06-05 14:47:12,190 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 14:47:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 860 transitions. [2021-06-05 14:47:12,191 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 860 transitions. Word has length 19 [2021-06-05 14:47:12,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:12,191 INFO L482 AbstractCegarLoop]: Abstraction has 281 states and 860 transitions. [2021-06-05 14:47:12,191 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 14:47:12,191 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 860 transitions. [2021-06-05 14:47:12,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:12,191 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:12,191 INFO L521 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 14:47:12,392 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 124 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable532 [2021-06-05 14:47:12,392 INFO L430 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:12,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:12,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1167792078, now seen corresponding path program 15 times [2021-06-05 14:47:12,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:12,392 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574651781] [2021-06-05 14:47:12,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:12,424 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 14:47:12,424 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:12,424 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574651781] [2021-06-05 14:47:12,424 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574651781] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:12,424 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777916145] [2021-06-05 14:47:12,424 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 14:47:12,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:47:12,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:12,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:12,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:12,502 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 14:47:12,502 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777916145] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:12,502 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:12,502 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:12,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592380796] [2021-06-05 14:47:12,502 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:12,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:12,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:12,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:12,503 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 14:47:12,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:12,592 INFO L93 Difference]: Finished difference Result 484 states and 1404 transitions. [2021-06-05 14:47:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:12,592 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 14:47:12,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:12,593 INFO L225 Difference]: With dead ends: 484 [2021-06-05 14:47:12,593 INFO L226 Difference]: Without dead ends: 484 [2021-06-05 14:47:12,593 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 70.0ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:12,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-06-05 14:47:12,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 272. [2021-06-05 14:47:12,596 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 14:47:12,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 830 transitions. [2021-06-05 14:47:12,596 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 830 transitions. Word has length 19 [2021-06-05 14:47:12,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:12,596 INFO L482 AbstractCegarLoop]: Abstraction has 272 states and 830 transitions. [2021-06-05 14:47:12,596 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 14:47:12,596 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 830 transitions. [2021-06-05 14:47:12,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:12,597 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:12,597 INFO L521 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 14:47:12,797 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 125 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable535 [2021-06-05 14:47:12,797 INFO L430 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:12,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:12,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1086551406, now seen corresponding path program 16 times [2021-06-05 14:47:12,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:12,797 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228708468] [2021-06-05 14:47:12,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:12,823 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 14:47:12,823 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:12,823 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228708468] [2021-06-05 14:47:12,823 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228708468] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:12,823 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047270153] [2021-06-05 14:47:12,823 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 14:47:12,850 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:47:12,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:12,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:12,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:12,902 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 14:47:12,902 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047270153] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:12,902 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:12,902 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:12,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441552816] [2021-06-05 14:47:12,902 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:12,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:12,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:12,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:12,902 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 14:47:12,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:12,966 INFO L93 Difference]: Finished difference Result 439 states and 1276 transitions. [2021-06-05 14:47:12,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:12,967 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 14:47:12,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:12,967 INFO L225 Difference]: With dead ends: 439 [2021-06-05 14:47:12,967 INFO L226 Difference]: Without dead ends: 430 [2021-06-05 14:47:12,967 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 62.3ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:12,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2021-06-05 14:47:12,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 272. [2021-06-05 14:47:12,970 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 14:47:12,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 826 transitions. [2021-06-05 14:47:12,970 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 826 transitions. Word has length 19 [2021-06-05 14:47:12,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:12,970 INFO L482 AbstractCegarLoop]: Abstraction has 272 states and 826 transitions. [2021-06-05 14:47:12,971 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 14:47:12,971 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 826 transitions. [2021-06-05 14:47:12,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:12,971 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:12,971 INFO L521 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 14:47:13,171 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 126 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable536 [2021-06-05 14:47:13,171 INFO L430 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:13,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:13,172 INFO L82 PathProgramCache]: Analyzing trace with hash -889110087, now seen corresponding path program 16 times [2021-06-05 14:47:13,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:13,172 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059194877] [2021-06-05 14:47:13,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:13,198 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 14:47:13,198 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:13,198 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059194877] [2021-06-05 14:47:13,198 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059194877] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:13,198 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361458907] [2021-06-05 14:47:13,198 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 14:47:13,223 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:47:13,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:13,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:13,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:13,271 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 14:47:13,271 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361458907] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:13,271 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:13,272 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:13,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279012052] [2021-06-05 14:47:13,272 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:13,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:13,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:13,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:13,272 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 14:47:13,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:13,346 INFO L93 Difference]: Finished difference Result 466 states and 1359 transitions. [2021-06-05 14:47:13,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:13,346 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 14:47:13,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:13,346 INFO L225 Difference]: With dead ends: 466 [2021-06-05 14:47:13,346 INFO L226 Difference]: Without dead ends: 466 [2021-06-05 14:47:13,347 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 61.6ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:13,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-06-05 14:47:13,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 268. [2021-06-05 14:47:13,349 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 14:47:13,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 814 transitions. [2021-06-05 14:47:13,350 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 814 transitions. Word has length 19 [2021-06-05 14:47:13,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:13,350 INFO L482 AbstractCegarLoop]: Abstraction has 268 states and 814 transitions. [2021-06-05 14:47:13,350 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 14:47:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 814 transitions. [2021-06-05 14:47:13,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:13,350 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:13,350 INFO L521 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 14:47:13,550 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable539,127 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:13,551 INFO L430 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:13,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:13,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1710395246, now seen corresponding path program 17 times [2021-06-05 14:47:13,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:13,551 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155644943] [2021-06-05 14:47:13,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:13,575 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 14:47:13,575 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:13,576 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155644943] [2021-06-05 14:47:13,576 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155644943] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:13,576 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:13,576 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:13,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553798022] [2021-06-05 14:47:13,576 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:13,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:13,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:13,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:13,576 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 14:47:13,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:13,664 INFO L93 Difference]: Finished difference Result 410 states and 1187 transitions. [2021-06-05 14:47:13,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:13,665 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 14:47:13,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:13,665 INFO L225 Difference]: With dead ends: 410 [2021-06-05 14:47:13,665 INFO L226 Difference]: Without dead ends: 404 [2021-06-05 14:47:13,665 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 61.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:13,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-06-05 14:47:13,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 278. [2021-06-05 14:47:13,668 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 14:47:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 839 transitions. [2021-06-05 14:47:13,669 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 839 transitions. Word has length 19 [2021-06-05 14:47:13,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:13,669 INFO L482 AbstractCegarLoop]: Abstraction has 278 states and 839 transitions. [2021-06-05 14:47:13,669 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 14:47:13,669 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 839 transitions. [2021-06-05 14:47:13,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:13,669 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:13,669 INFO L521 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 14:47:13,669 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable540 [2021-06-05 14:47:13,669 INFO L430 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:13,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:13,669 INFO L82 PathProgramCache]: Analyzing trace with hash 608481094, now seen corresponding path program 18 times [2021-06-05 14:47:13,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:13,670 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541208127] [2021-06-05 14:47:13,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:13,700 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 14:47:13,700 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:13,701 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541208127] [2021-06-05 14:47:13,701 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541208127] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:13,701 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:13,701 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:13,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955112149] [2021-06-05 14:47:13,701 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:13,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:13,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:13,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:13,701 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 14:47:13,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:13,793 INFO L93 Difference]: Finished difference Result 374 states and 1104 transitions. [2021-06-05 14:47:13,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:13,793 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 14:47:13,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:13,794 INFO L225 Difference]: With dead ends: 374 [2021-06-05 14:47:13,794 INFO L226 Difference]: Without dead ends: 363 [2021-06-05 14:47:13,794 INFO L777 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 14:47:13,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-06-05 14:47:13,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 268. [2021-06-05 14:47:13,797 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 14:47:13,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 813 transitions. [2021-06-05 14:47:13,797 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 813 transitions. Word has length 19 [2021-06-05 14:47:13,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:13,797 INFO L482 AbstractCegarLoop]: Abstraction has 268 states and 813 transitions. [2021-06-05 14:47:13,797 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 14:47:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 813 transitions. [2021-06-05 14:47:13,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:13,797 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:13,798 INFO L521 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 14:47:13,798 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable541 [2021-06-05 14:47:13,798 INFO L430 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:13,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:13,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1860559839, now seen corresponding path program 17 times [2021-06-05 14:47:13,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:13,798 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576412807] [2021-06-05 14:47:13,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:13,821 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 14:47:13,821 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:13,821 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576412807] [2021-06-05 14:47:13,821 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576412807] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:13,821 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:13,821 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:13,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216409433] [2021-06-05 14:47:13,821 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:13,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:13,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:13,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:13,822 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 14:47:13,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:13,893 INFO L93 Difference]: Finished difference Result 435 states and 1255 transitions. [2021-06-05 14:47:13,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:13,894 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 14:47:13,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:13,894 INFO L225 Difference]: With dead ends: 435 [2021-06-05 14:47:13,894 INFO L226 Difference]: Without dead ends: 429 [2021-06-05 14:47:13,894 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 43.0ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:13,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2021-06-05 14:47:13,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 274. [2021-06-05 14:47:13,897 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 14:47:13,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 827 transitions. [2021-06-05 14:47:13,898 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 827 transitions. Word has length 19 [2021-06-05 14:47:13,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:13,898 INFO L482 AbstractCegarLoop]: Abstraction has 274 states and 827 transitions. [2021-06-05 14:47:13,898 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 14:47:13,898 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 827 transitions. [2021-06-05 14:47:13,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:13,898 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:13,898 INFO L521 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 14:47:13,898 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable542 [2021-06-05 14:47:13,898 INFO L430 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:13,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:13,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1590050147, now seen corresponding path program 18 times [2021-06-05 14:47:13,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:13,898 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238157] [2021-06-05 14:47:13,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:13,924 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 14:47:13,924 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:13,924 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238157] [2021-06-05 14:47:13,924 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238157] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:13,924 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:13,924 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:13,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715072703] [2021-06-05 14:47:13,924 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:13,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:13,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:13,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:13,925 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 14:47:13,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:13,998 INFO L93 Difference]: Finished difference Result 413 states and 1218 transitions. [2021-06-05 14:47:13,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:13,998 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 14:47:13,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:13,999 INFO L225 Difference]: With dead ends: 413 [2021-06-05 14:47:13,999 INFO L226 Difference]: Without dead ends: 413 [2021-06-05 14:47:13,999 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 42.0ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:13,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-06-05 14:47:14,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 253. [2021-06-05 14:47:14,002 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 14:47:14,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 763 transitions. [2021-06-05 14:47:14,002 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 763 transitions. Word has length 19 [2021-06-05 14:47:14,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:14,002 INFO L482 AbstractCegarLoop]: Abstraction has 253 states and 763 transitions. [2021-06-05 14:47:14,002 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 14:47:14,002 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 763 transitions. [2021-06-05 14:47:14,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:14,003 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:14,003 INFO L521 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 14:47:14,003 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable543 [2021-06-05 14:47:14,003 INFO L430 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:14,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:14,003 INFO L82 PathProgramCache]: Analyzing trace with hash 53973003, now seen corresponding path program 19 times [2021-06-05 14:47:14,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:14,003 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518028836] [2021-06-05 14:47:14,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:14,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 14:47:14,026 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:14,026 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518028836] [2021-06-05 14:47:14,026 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518028836] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:14,026 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:14,026 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:14,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296081837] [2021-06-05 14:47:14,026 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:14,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:14,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:14,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:14,026 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 14:47:14,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:14,102 INFO L93 Difference]: Finished difference Result 398 states and 1147 transitions. [2021-06-05 14:47:14,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:14,102 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 14:47:14,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:14,102 INFO L225 Difference]: With dead ends: 398 [2021-06-05 14:47:14,102 INFO L226 Difference]: Without dead ends: 382 [2021-06-05 14:47:14,102 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 55.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:14,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-06-05 14:47:14,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 259. [2021-06-05 14:47:14,105 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 14:47:14,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 780 transitions. [2021-06-05 14:47:14,105 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 780 transitions. Word has length 19 [2021-06-05 14:47:14,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:14,106 INFO L482 AbstractCegarLoop]: Abstraction has 259 states and 780 transitions. [2021-06-05 14:47:14,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 14:47:14,106 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 780 transitions. [2021-06-05 14:47:14,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:14,106 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:14,106 INFO L521 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 14:47:14,106 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable544 [2021-06-05 14:47:14,106 INFO L430 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:14,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:14,106 INFO L82 PathProgramCache]: Analyzing trace with hash -481846493, now seen corresponding path program 20 times [2021-06-05 14:47:14,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:14,106 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317443707] [2021-06-05 14:47:14,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:14,130 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 14:47:14,130 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:14,130 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317443707] [2021-06-05 14:47:14,130 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317443707] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:14,130 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:14,130 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:14,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944315509] [2021-06-05 14:47:14,130 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:14,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:14,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:14,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:14,130 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 14:47:14,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:14,218 INFO L93 Difference]: Finished difference Result 427 states and 1201 transitions. [2021-06-05 14:47:14,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:14,218 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 14:47:14,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:14,219 INFO L225 Difference]: With dead ends: 427 [2021-06-05 14:47:14,219 INFO L226 Difference]: Without dead ends: 419 [2021-06-05 14:47:14,219 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 69.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:14,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-06-05 14:47:14,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 275. [2021-06-05 14:47:14,222 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 14:47:14,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 824 transitions. [2021-06-05 14:47:14,222 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 824 transitions. Word has length 19 [2021-06-05 14:47:14,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:14,223 INFO L482 AbstractCegarLoop]: Abstraction has 275 states and 824 transitions. [2021-06-05 14:47:14,223 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 14:47:14,223 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 824 transitions. [2021-06-05 14:47:14,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:14,223 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:14,223 INFO L521 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 14:47:14,223 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable545 [2021-06-05 14:47:14,223 INFO L430 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:14,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:14,223 INFO L82 PathProgramCache]: Analyzing trace with hash -101108853, now seen corresponding path program 21 times [2021-06-05 14:47:14,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:14,223 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365634597] [2021-06-05 14:47:14,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:14,246 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 14:47:14,246 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:14,247 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365634597] [2021-06-05 14:47:14,247 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365634597] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:14,247 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:14,247 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:14,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212105241] [2021-06-05 14:47:14,247 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:14,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:14,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:14,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:14,247 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 14:47:14,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:14,327 INFO L93 Difference]: Finished difference Result 390 states and 1115 transitions. [2021-06-05 14:47:14,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:14,327 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 14:47:14,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:14,328 INFO L225 Difference]: With dead ends: 390 [2021-06-05 14:47:14,328 INFO L226 Difference]: Without dead ends: 380 [2021-06-05 14:47:14,328 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 64.4ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:14,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-06-05 14:47:14,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 265. [2021-06-05 14:47:14,331 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 14:47:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 796 transitions. [2021-06-05 14:47:14,331 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 796 transitions. Word has length 19 [2021-06-05 14:47:14,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:14,331 INFO L482 AbstractCegarLoop]: Abstraction has 265 states and 796 transitions. [2021-06-05 14:47:14,331 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 14:47:14,331 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 796 transitions. [2021-06-05 14:47:14,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:14,332 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:14,332 INFO L521 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 14:47:14,332 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable546 [2021-06-05 14:47:14,332 INFO L430 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:14,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:14,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1901365676, now seen corresponding path program 19 times [2021-06-05 14:47:14,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:14,332 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769700996] [2021-06-05 14:47:14,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:14,355 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 14:47:14,355 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:14,355 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769700996] [2021-06-05 14:47:14,355 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769700996] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:14,355 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927982934] [2021-06-05 14:47:14,355 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 14:47:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:14,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:14,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:14,413 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 14:47:14,413 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927982934] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:14,413 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:14,413 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:47:14,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032103617] [2021-06-05 14:47:14,413 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:47:14,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:14,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:47:14,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:47:14,413 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 14:47:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:14,480 INFO L93 Difference]: Finished difference Result 537 states and 1572 transitions. [2021-06-05 14:47:14,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:14,480 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 14:47:14,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:14,481 INFO L225 Difference]: With dead ends: 537 [2021-06-05 14:47:14,481 INFO L226 Difference]: Without dead ends: 537 [2021-06-05 14:47:14,481 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 45.9ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:14,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2021-06-05 14:47:14,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 271. [2021-06-05 14:47:14,484 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 14:47:14,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 817 transitions. [2021-06-05 14:47:14,484 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 817 transitions. Word has length 19 [2021-06-05 14:47:14,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:14,485 INFO L482 AbstractCegarLoop]: Abstraction has 271 states and 817 transitions. [2021-06-05 14:47:14,485 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 14:47:14,485 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 817 transitions. [2021-06-05 14:47:14,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:14,485 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:14,485 INFO L521 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 14:47:14,685 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 128 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable547 [2021-06-05 14:47:14,685 INFO L430 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:14,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:14,686 INFO L82 PathProgramCache]: Analyzing trace with hash -2057197508, now seen corresponding path program 20 times [2021-06-05 14:47:14,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:14,686 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097189471] [2021-06-05 14:47:14,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:14,710 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 14:47:14,711 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:14,711 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097189471] [2021-06-05 14:47:14,711 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097189471] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:14,711 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308845976] [2021-06-05 14:47:14,711 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 14:47:14,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:14,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:14,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:14,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:14,779 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 14:47:14,779 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308845976] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:14,779 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:14,779 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:14,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064408598] [2021-06-05 14:47:14,779 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:14,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:14,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:14,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:14,780 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 14:47:14,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:14,856 INFO L93 Difference]: Finished difference Result 552 states and 1596 transitions. [2021-06-05 14:47:14,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:14,856 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 14:47:14,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:14,857 INFO L225 Difference]: With dead ends: 552 [2021-06-05 14:47:14,857 INFO L226 Difference]: Without dead ends: 552 [2021-06-05 14:47:14,857 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 54.0ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:14,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2021-06-05 14:47:14,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 277. [2021-06-05 14:47:14,860 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 14:47:14,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 844 transitions. [2021-06-05 14:47:14,861 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 844 transitions. Word has length 19 [2021-06-05 14:47:14,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:14,861 INFO L482 AbstractCegarLoop]: Abstraction has 277 states and 844 transitions. [2021-06-05 14:47:14,861 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 14:47:14,861 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 844 transitions. [2021-06-05 14:47:14,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:14,861 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:14,861 INFO L521 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 14:47:15,064 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable548,129 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:15,065 INFO L430 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:15,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:15,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1127036332, now seen corresponding path program 21 times [2021-06-05 14:47:15,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:15,065 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112711011] [2021-06-05 14:47:15,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:15,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 14:47:15,088 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:15,088 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112711011] [2021-06-05 14:47:15,088 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112711011] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:15,088 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646694108] [2021-06-05 14:47:15,089 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 14:47:15,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:47:15,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:15,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:15,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:15,154 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 14:47:15,154 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646694108] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:15,154 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:15,154 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:15,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15501659] [2021-06-05 14:47:15,154 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:15,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:15,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:15,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:15,154 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 14:47:15,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:15,222 INFO L93 Difference]: Finished difference Result 498 states and 1443 transitions. [2021-06-05 14:47:15,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:15,222 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 14:47:15,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:15,223 INFO L225 Difference]: With dead ends: 498 [2021-06-05 14:47:15,223 INFO L226 Difference]: Without dead ends: 492 [2021-06-05 14:47:15,223 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 50.9ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:15,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-06-05 14:47:15,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 274. [2021-06-05 14:47:15,226 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 14:47:15,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 834 transitions. [2021-06-05 14:47:15,226 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 834 transitions. Word has length 19 [2021-06-05 14:47:15,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:15,226 INFO L482 AbstractCegarLoop]: Abstraction has 274 states and 834 transitions. [2021-06-05 14:47:15,226 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 14:47:15,226 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 834 transitions. [2021-06-05 14:47:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:15,227 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:15,227 INFO L521 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 14:47:15,427 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable549,130 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:15,427 INFO L430 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:15,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:15,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1979218041, now seen corresponding path program 22 times [2021-06-05 14:47:15,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:15,428 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924053359] [2021-06-05 14:47:15,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:15,451 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 14:47:15,451 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:15,451 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924053359] [2021-06-05 14:47:15,451 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924053359] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:15,451 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519869989] [2021-06-05 14:47:15,451 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 14:47:15,475 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:47:15,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:15,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:15,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:15,516 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 14:47:15,516 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519869989] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:15,516 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:15,516 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:15,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552161968] [2021-06-05 14:47:15,516 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:15,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:15,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:15,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:15,516 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 14:47:15,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:15,581 INFO L93 Difference]: Finished difference Result 476 states and 1382 transitions. [2021-06-05 14:47:15,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:15,581 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 14:47:15,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:15,582 INFO L225 Difference]: With dead ends: 476 [2021-06-05 14:47:15,582 INFO L226 Difference]: Without dead ends: 460 [2021-06-05 14:47:15,582 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 54.5ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-06-05 14:47:15,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 271. [2021-06-05 14:47:15,585 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 14:47:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 824 transitions. [2021-06-05 14:47:15,585 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 824 transitions. Word has length 19 [2021-06-05 14:47:15,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:15,585 INFO L482 AbstractCegarLoop]: Abstraction has 271 states and 824 transitions. [2021-06-05 14:47:15,586 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 14:47:15,586 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 824 transitions. [2021-06-05 14:47:15,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:15,586 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:15,586 INFO L521 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 14:47:15,796 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable552,131 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:15,797 INFO L430 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:15,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:15,797 INFO L82 PathProgramCache]: Analyzing trace with hash 16056364, now seen corresponding path program 22 times [2021-06-05 14:47:15,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:15,797 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733776832] [2021-06-05 14:47:15,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:15,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 14:47:15,821 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:15,821 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733776832] [2021-06-05 14:47:15,821 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733776832] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:15,821 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244746015] [2021-06-05 14:47:15,821 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 14:47:15,852 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:47:15,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:15,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:15,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:15,884 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 14:47:15,884 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244746015] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:15,884 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:15,884 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:47:15,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760184833] [2021-06-05 14:47:15,884 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:47:15,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:15,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:47:15,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:47:15,884 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 14:47:15,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:15,953 INFO L93 Difference]: Finished difference Result 539 states and 1596 transitions. [2021-06-05 14:47:15,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:15,954 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 14:47:15,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:15,955 INFO L225 Difference]: With dead ends: 539 [2021-06-05 14:47:15,955 INFO L226 Difference]: Without dead ends: 539 [2021-06-05 14:47:15,955 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 46.6ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:15,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-06-05 14:47:15,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 259. [2021-06-05 14:47:15,958 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 14:47:15,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 782 transitions. [2021-06-05 14:47:15,959 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 782 transitions. Word has length 19 [2021-06-05 14:47:15,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:15,959 INFO L482 AbstractCegarLoop]: Abstraction has 259 states and 782 transitions. [2021-06-05 14:47:15,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 14:47:15,959 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 782 transitions. [2021-06-05 14:47:15,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:15,959 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:15,959 INFO L521 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 14:47:16,164 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable555,132 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:16,165 INFO L430 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:16,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:16,165 INFO L82 PathProgramCache]: Analyzing trace with hash -366317049, now seen corresponding path program 23 times [2021-06-05 14:47:16,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:16,165 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871896622] [2021-06-05 14:47:16,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:16,190 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 14:47:16,191 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:16,191 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871896622] [2021-06-05 14:47:16,191 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871896622] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:16,191 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635743092] [2021-06-05 14:47:16,191 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 14:47:16,216 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:16,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:16,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:16,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:16,268 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 14:47:16,268 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635743092] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:16,268 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:16,268 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:16,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528073308] [2021-06-05 14:47:16,268 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:16,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:16,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:16,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:16,269 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 14:47:16,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:16,339 INFO L93 Difference]: Finished difference Result 482 states and 1413 transitions. [2021-06-05 14:47:16,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:16,339 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 14:47:16,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:16,340 INFO L225 Difference]: With dead ends: 482 [2021-06-05 14:47:16,340 INFO L226 Difference]: Without dead ends: 474 [2021-06-05 14:47:16,340 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 66.3ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:47:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-06-05 14:47:16,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 275. [2021-06-05 14:47:16,343 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 14:47:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 838 transitions. [2021-06-05 14:47:16,343 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 838 transitions. Word has length 19 [2021-06-05 14:47:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:16,343 INFO L482 AbstractCegarLoop]: Abstraction has 275 states and 838 transitions. [2021-06-05 14:47:16,343 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 14:47:16,343 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 838 transitions. [2021-06-05 14:47:16,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:16,344 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:16,344 INFO L521 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 14:47:16,556 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 133 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable556 [2021-06-05 14:47:16,557 INFO L430 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:16,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:16,557 INFO L82 PathProgramCache]: Analyzing trace with hash -334370096, now seen corresponding path program 23 times [2021-06-05 14:47:16,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:16,557 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967118442] [2021-06-05 14:47:16,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:16,583 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 14:47:16,583 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:16,583 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967118442] [2021-06-05 14:47:16,583 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967118442] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:16,584 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051721333] [2021-06-05 14:47:16,584 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 14:47:16,609 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:16,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:16,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:16,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:16,646 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 14:47:16,646 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051721333] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:16,646 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:16,646 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:16,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111526682] [2021-06-05 14:47:16,646 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:16,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:16,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:16,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:16,647 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 14:47:16,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:16,727 INFO L93 Difference]: Finished difference Result 532 states and 1566 transitions. [2021-06-05 14:47:16,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:16,727 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 14:47:16,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:16,728 INFO L225 Difference]: With dead ends: 532 [2021-06-05 14:47:16,728 INFO L226 Difference]: Without dead ends: 532 [2021-06-05 14:47:16,728 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 54.7ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:16,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-06-05 14:47:16,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 275. [2021-06-05 14:47:16,731 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 14:47:16,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 838 transitions. [2021-06-05 14:47:16,731 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 838 transitions. Word has length 19 [2021-06-05 14:47:16,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:16,731 INFO L482 AbstractCegarLoop]: Abstraction has 275 states and 838 transitions. [2021-06-05 14:47:16,731 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 14:47:16,732 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 838 transitions. [2021-06-05 14:47:16,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:16,732 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:16,732 INFO L521 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 14:47:16,932 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable559,134 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:16,932 INFO L430 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:16,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:16,933 INFO L82 PathProgramCache]: Analyzing trace with hash 2088629120, now seen corresponding path program 24 times [2021-06-05 14:47:16,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:16,933 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762552588] [2021-06-05 14:47:16,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:16,955 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 14:47:16,955 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:16,955 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762552588] [2021-06-05 14:47:16,955 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762552588] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:16,955 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399678866] [2021-06-05 14:47:16,955 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 14:47:16,980 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:47:16,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:16,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:16,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:17,019 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 14:47:17,019 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399678866] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:17,019 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:17,019 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:17,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047534110] [2021-06-05 14:47:17,019 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:17,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:17,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:17,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:17,020 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 14:47:17,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:17,087 INFO L93 Difference]: Finished difference Result 478 states and 1416 transitions. [2021-06-05 14:47:17,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:17,087 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 14:47:17,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:17,087 INFO L225 Difference]: With dead ends: 478 [2021-06-05 14:47:17,088 INFO L226 Difference]: Without dead ends: 469 [2021-06-05 14:47:17,088 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 49.3ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:17,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2021-06-05 14:47:17,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 275. [2021-06-05 14:47:17,091 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 14:47:17,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 834 transitions. [2021-06-05 14:47:17,091 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 834 transitions. Word has length 19 [2021-06-05 14:47:17,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:17,091 INFO L482 AbstractCegarLoop]: Abstraction has 275 states and 834 transitions. [2021-06-05 14:47:17,091 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 14:47:17,091 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 834 transitions. [2021-06-05 14:47:17,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:17,091 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:17,092 INFO L521 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 14:47:17,304 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable560,135 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:17,305 INFO L430 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:17,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:17,305 INFO L82 PathProgramCache]: Analyzing trace with hash 112967627, now seen corresponding path program 24 times [2021-06-05 14:47:17,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:17,305 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349839927] [2021-06-05 14:47:17,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:17,333 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 14:47:17,333 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:17,333 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349839927] [2021-06-05 14:47:17,333 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349839927] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:17,333 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50741878] [2021-06-05 14:47:17,333 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 14:47:17,358 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:47:17,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:17,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:17,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:17,409 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 14:47:17,409 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50741878] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:17,409 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:17,409 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:17,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630284445] [2021-06-05 14:47:17,409 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:17,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:17,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:17,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:17,410 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 14:47:17,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:17,493 INFO L93 Difference]: Finished difference Result 445 states and 1322 transitions. [2021-06-05 14:47:17,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:17,493 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 14:47:17,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:17,494 INFO L225 Difference]: With dead ends: 445 [2021-06-05 14:47:17,494 INFO L226 Difference]: Without dead ends: 445 [2021-06-05 14:47:17,494 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 71.5ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:47:17,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-06-05 14:47:17,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 255. [2021-06-05 14:47:17,497 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 14:47:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 770 transitions. [2021-06-05 14:47:17,497 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 770 transitions. Word has length 19 [2021-06-05 14:47:17,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:17,497 INFO L482 AbstractCegarLoop]: Abstraction has 255 states and 770 transitions. [2021-06-05 14:47:17,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 14:47:17,497 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 770 transitions. [2021-06-05 14:47:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:17,498 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:17,498 INFO L521 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 14:47:17,698 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 136 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable563 [2021-06-05 14:47:17,698 INFO L430 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:17,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:17,698 INFO L82 PathProgramCache]: Analyzing trace with hash 510647071, now seen corresponding path program 25 times [2021-06-05 14:47:17,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:17,699 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491639563] [2021-06-05 14:47:17,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:17,723 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 14:47:17,723 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:17,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491639563] [2021-06-05 14:47:17,723 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491639563] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:17,723 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:17,723 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:17,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392351041] [2021-06-05 14:47:17,723 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:17,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:17,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:17,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:17,724 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 14:47:17,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:17,813 INFO L93 Difference]: Finished difference Result 454 states and 1310 transitions. [2021-06-05 14:47:17,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:17,813 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 14:47:17,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:17,814 INFO L225 Difference]: With dead ends: 454 [2021-06-05 14:47:17,814 INFO L226 Difference]: Without dead ends: 446 [2021-06-05 14:47:17,814 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 60.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:17,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2021-06-05 14:47:17,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 275. [2021-06-05 14:47:17,817 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 14:47:17,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 836 transitions. [2021-06-05 14:47:17,817 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 836 transitions. Word has length 19 [2021-06-05 14:47:17,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:17,817 INFO L482 AbstractCegarLoop]: Abstraction has 275 states and 836 transitions. [2021-06-05 14:47:17,817 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 14:47:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 836 transitions. [2021-06-05 14:47:17,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:17,818 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:17,818 INFO L521 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 14:47:17,818 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable564 [2021-06-05 14:47:17,818 INFO L430 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:17,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:17,818 INFO L82 PathProgramCache]: Analyzing trace with hash 891384711, now seen corresponding path program 26 times [2021-06-05 14:47:17,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:17,818 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868475114] [2021-06-05 14:47:17,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:17,844 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 14:47:17,844 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:17,844 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868475114] [2021-06-05 14:47:17,844 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868475114] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:17,844 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:17,845 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:17,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461148925] [2021-06-05 14:47:17,845 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:17,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:17,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:17,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:17,845 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 14:47:17,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:17,931 INFO L93 Difference]: Finished difference Result 460 states and 1325 transitions. [2021-06-05 14:47:17,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:17,932 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 14:47:17,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:17,932 INFO L225 Difference]: With dead ends: 460 [2021-06-05 14:47:17,932 INFO L226 Difference]: Without dead ends: 452 [2021-06-05 14:47:17,932 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 60.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:17,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-06-05 14:47:17,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 279. [2021-06-05 14:47:17,935 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 14:47:17,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 845 transitions. [2021-06-05 14:47:17,936 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 845 transitions. Word has length 19 [2021-06-05 14:47:17,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:17,936 INFO L482 AbstractCegarLoop]: Abstraction has 279 states and 845 transitions. [2021-06-05 14:47:17,936 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 14:47:17,936 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 845 transitions. [2021-06-05 14:47:17,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:17,936 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:17,936 INFO L521 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 14:47:17,936 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable565 [2021-06-05 14:47:17,937 INFO L430 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:17,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:17,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1851957296, now seen corresponding path program 25 times [2021-06-05 14:47:17,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:17,937 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336153316] [2021-06-05 14:47:17,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:17,961 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 14:47:17,961 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:17,961 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336153316] [2021-06-05 14:47:17,961 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336153316] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:17,961 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343086668] [2021-06-05 14:47:17,961 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 14:47:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:17,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:17,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:18,034 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 14:47:18,034 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343086668] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:18,034 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:18,034 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:18,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133055081] [2021-06-05 14:47:18,034 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:18,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:18,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:18,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:18,035 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 14:47:18,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:18,113 INFO L93 Difference]: Finished difference Result 519 states and 1519 transitions. [2021-06-05 14:47:18,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:18,113 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 14:47:18,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:18,114 INFO L225 Difference]: With dead ends: 519 [2021-06-05 14:47:18,114 INFO L226 Difference]: Without dead ends: 519 [2021-06-05 14:47:18,114 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 55.1ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:18,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2021-06-05 14:47:18,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 285. [2021-06-05 14:47:18,117 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 14:47:18,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 872 transitions. [2021-06-05 14:47:18,118 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 872 transitions. Word has length 19 [2021-06-05 14:47:18,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:18,118 INFO L482 AbstractCegarLoop]: Abstraction has 285 states and 872 transitions. [2021-06-05 14:47:18,118 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 14:47:18,118 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 872 transitions. [2021-06-05 14:47:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:18,118 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:18,118 INFO L521 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 14:47:18,318 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable566,137 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:18,319 INFO L430 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:18,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:18,319 INFO L82 PathProgramCache]: Analyzing trace with hash -921796120, now seen corresponding path program 26 times [2021-06-05 14:47:18,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:18,319 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440106560] [2021-06-05 14:47:18,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:18,342 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 14:47:18,342 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:18,343 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440106560] [2021-06-05 14:47:18,343 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440106560] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:18,343 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525851645] [2021-06-05 14:47:18,343 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 14:47:18,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:18,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:18,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:18,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:18,422 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 14:47:18,422 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525851645] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:18,422 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:18,422 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:18,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938097288] [2021-06-05 14:47:18,423 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:18,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:18,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:18,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:18,423 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 14:47:18,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:18,489 INFO L93 Difference]: Finished difference Result 501 states and 1450 transitions. [2021-06-05 14:47:18,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:18,490 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 14:47:18,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:18,490 INFO L225 Difference]: With dead ends: 501 [2021-06-05 14:47:18,490 INFO L226 Difference]: Without dead ends: 495 [2021-06-05 14:47:18,491 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 54.5ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:18,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2021-06-05 14:47:18,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 284. [2021-06-05 14:47:18,494 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 14:47:18,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 867 transitions. [2021-06-05 14:47:18,494 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 867 transitions. Word has length 19 [2021-06-05 14:47:18,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:18,494 INFO L482 AbstractCegarLoop]: Abstraction has 284 states and 867 transitions. [2021-06-05 14:47:18,494 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 14:47:18,494 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 867 transitions. [2021-06-05 14:47:18,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:18,495 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:18,495 INFO L521 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 14:47:18,695 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 138 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable567 [2021-06-05 14:47:18,695 INFO L430 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:18,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:18,695 INFO L82 PathProgramCache]: Analyzing trace with hash 306512931, now seen corresponding path program 27 times [2021-06-05 14:47:18,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:18,696 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883923923] [2021-06-05 14:47:18,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:18,721 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 14:47:18,721 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:18,721 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883923923] [2021-06-05 14:47:18,721 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883923923] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:18,721 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80005447] [2021-06-05 14:47:18,721 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 14:47:18,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:47:18,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:18,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:18,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:18,797 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 14:47:18,797 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80005447] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:18,797 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:18,797 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:18,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200917784] [2021-06-05 14:47:18,797 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:18,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:18,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:18,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:18,797 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 14:47:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:18,887 INFO L93 Difference]: Finished difference Result 478 states and 1372 transitions. [2021-06-05 14:47:18,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:18,888 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 14:47:18,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:18,888 INFO L225 Difference]: With dead ends: 478 [2021-06-05 14:47:18,888 INFO L226 Difference]: Without dead ends: 470 [2021-06-05 14:47:18,888 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 61.7ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:18,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2021-06-05 14:47:18,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 284. [2021-06-05 14:47:18,891 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 14:47:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 870 transitions. [2021-06-05 14:47:18,892 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 870 transitions. Word has length 19 [2021-06-05 14:47:18,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:18,892 INFO L482 AbstractCegarLoop]: Abstraction has 284 states and 870 transitions. [2021-06-05 14:47:18,892 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 14:47:18,892 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 870 transitions. [2021-06-05 14:47:18,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:18,892 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:18,893 INFO L521 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 14:47:19,093 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable570,139 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:19,093 INFO L430 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:19,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:19,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1651557640, now seen corresponding path program 27 times [2021-06-05 14:47:19,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:19,093 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402053442] [2021-06-05 14:47:19,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:19,120 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 14:47:19,120 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:19,120 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402053442] [2021-06-05 14:47:19,120 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402053442] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:19,120 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807552323] [2021-06-05 14:47:19,120 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 14:47:19,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:47:19,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:19,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:19,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:19,188 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 14:47:19,189 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807552323] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:19,189 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:19,189 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:19,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217103672] [2021-06-05 14:47:19,189 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:19,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:19,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:19,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:19,189 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 14:47:19,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:19,258 INFO L93 Difference]: Finished difference Result 498 states and 1443 transitions. [2021-06-05 14:47:19,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:19,258 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 14:47:19,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:19,259 INFO L225 Difference]: With dead ends: 498 [2021-06-05 14:47:19,259 INFO L226 Difference]: Without dead ends: 498 [2021-06-05 14:47:19,259 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 56.3ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:19,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2021-06-05 14:47:19,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 275. [2021-06-05 14:47:19,262 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 14:47:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 840 transitions. [2021-06-05 14:47:19,263 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 840 transitions. Word has length 19 [2021-06-05 14:47:19,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:19,263 INFO L482 AbstractCegarLoop]: Abstraction has 275 states and 840 transitions. [2021-06-05 14:47:19,263 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 14:47:19,263 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 840 transitions. [2021-06-05 14:47:19,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:19,263 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:19,263 INFO L521 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 14:47:19,463 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 140 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable573 [2021-06-05 14:47:19,464 INFO L430 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:19,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:19,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1732798312, now seen corresponding path program 28 times [2021-06-05 14:47:19,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:19,464 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897450215] [2021-06-05 14:47:19,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:19,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 14:47:19,488 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:19,488 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897450215] [2021-06-05 14:47:19,488 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897450215] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:19,488 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000351992] [2021-06-05 14:47:19,488 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 14:47:19,512 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:47:19,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:19,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:19,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:19,555 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 14:47:19,555 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000351992] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:19,555 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:19,555 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:19,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832561389] [2021-06-05 14:47:19,555 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:19,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:19,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:19,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:19,555 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 14:47:19,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:19,640 INFO L93 Difference]: Finished difference Result 453 states and 1315 transitions. [2021-06-05 14:47:19,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:19,640 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 14:47:19,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:19,640 INFO L225 Difference]: With dead ends: 453 [2021-06-05 14:47:19,640 INFO L226 Difference]: Without dead ends: 444 [2021-06-05 14:47:19,641 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 51.5ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:19,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-06-05 14:47:19,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 275. [2021-06-05 14:47:19,643 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 14:47:19,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 836 transitions. [2021-06-05 14:47:19,644 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 836 transitions. Word has length 19 [2021-06-05 14:47:19,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:19,644 INFO L482 AbstractCegarLoop]: Abstraction has 275 states and 836 transitions. [2021-06-05 14:47:19,644 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 14:47:19,644 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 836 transitions. [2021-06-05 14:47:19,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:19,644 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:19,644 INFO L521 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 14:47:19,845 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable574,141 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:19,845 INFO L430 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:19,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:19,845 INFO L82 PathProgramCache]: Analyzing trace with hash 586507491, now seen corresponding path program 28 times [2021-06-05 14:47:19,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:19,845 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126088420] [2021-06-05 14:47:19,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:19,873 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 14:47:19,873 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:19,873 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126088420] [2021-06-05 14:47:19,873 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126088420] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:19,873 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264396826] [2021-06-05 14:47:19,873 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 14:47:19,898 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:47:19,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:19,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:19,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:19,949 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 14:47:19,949 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264396826] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:19,949 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:19,950 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:19,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587897784] [2021-06-05 14:47:19,950 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:19,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:19,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:19,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:19,950 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 14:47:20,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:20,041 INFO L93 Difference]: Finished difference Result 450 states and 1322 transitions. [2021-06-05 14:47:20,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:20,042 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 14:47:20,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:20,042 INFO L225 Difference]: With dead ends: 450 [2021-06-05 14:47:20,042 INFO L226 Difference]: Without dead ends: 450 [2021-06-05 14:47:20,042 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 67.8ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:20,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-06-05 14:47:20,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 271. [2021-06-05 14:47:20,045 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 14:47:20,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 824 transitions. [2021-06-05 14:47:20,046 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 824 transitions. Word has length 19 [2021-06-05 14:47:20,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:20,046 INFO L482 AbstractCegarLoop]: Abstraction has 271 states and 824 transitions. [2021-06-05 14:47:20,046 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 14:47:20,046 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 824 transitions. [2021-06-05 14:47:20,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:20,046 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:20,046 INFO L521 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 14:47:20,247 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 142 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable577 [2021-06-05 14:47:20,247 INFO L430 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:20,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:20,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1108954472, now seen corresponding path program 29 times [2021-06-05 14:47:20,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:20,247 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970665832] [2021-06-05 14:47:20,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:20,270 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 14:47:20,270 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:20,270 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970665832] [2021-06-05 14:47:20,270 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970665832] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:20,270 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:20,270 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:20,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807179862] [2021-06-05 14:47:20,270 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:20,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:20,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:20,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:20,271 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 14:47:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:20,354 INFO L93 Difference]: Finished difference Result 424 states and 1226 transitions. [2021-06-05 14:47:20,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:20,355 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 14:47:20,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:20,355 INFO L225 Difference]: With dead ends: 424 [2021-06-05 14:47:20,355 INFO L226 Difference]: Without dead ends: 418 [2021-06-05 14:47:20,355 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 54.2ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:20,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-06-05 14:47:20,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 281. [2021-06-05 14:47:20,358 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 14:47:20,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 849 transitions. [2021-06-05 14:47:20,359 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 849 transitions. Word has length 19 [2021-06-05 14:47:20,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:20,359 INFO L482 AbstractCegarLoop]: Abstraction has 281 states and 849 transitions. [2021-06-05 14:47:20,359 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 14:47:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 849 transitions. [2021-06-05 14:47:20,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:20,359 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:20,359 INFO L521 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 14:47:20,359 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable578 [2021-06-05 14:47:20,359 INFO L430 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:20,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:20,360 INFO L82 PathProgramCache]: Analyzing trace with hash 2084098672, now seen corresponding path program 30 times [2021-06-05 14:47:20,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:20,360 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857270455] [2021-06-05 14:47:20,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:20,384 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 14:47:20,384 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:20,384 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857270455] [2021-06-05 14:47:20,384 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857270455] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:20,384 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:20,384 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:20,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459401207] [2021-06-05 14:47:20,385 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:20,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:20,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:20,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:20,385 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 14:47:20,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:20,460 INFO L93 Difference]: Finished difference Result 388 states and 1143 transitions. [2021-06-05 14:47:20,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:20,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 14:47:20,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:20,461 INFO L225 Difference]: With dead ends: 388 [2021-06-05 14:47:20,461 INFO L226 Difference]: Without dead ends: 377 [2021-06-05 14:47:20,461 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 43.4ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:20,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-06-05 14:47:20,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 271. [2021-06-05 14:47:20,464 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 14:47:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 823 transitions. [2021-06-05 14:47:20,464 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 823 transitions. Word has length 19 [2021-06-05 14:47:20,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:20,465 INFO L482 AbstractCegarLoop]: Abstraction has 271 states and 823 transitions. [2021-06-05 14:47:20,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 14:47:20,465 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 823 transitions. [2021-06-05 14:47:20,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:20,465 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:20,465 INFO L521 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 14:47:20,465 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable579 [2021-06-05 14:47:20,465 INFO L430 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:20,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:20,465 INFO L82 PathProgramCache]: Analyzing trace with hash -384942261, now seen corresponding path program 29 times [2021-06-05 14:47:20,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:20,465 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363513717] [2021-06-05 14:47:20,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:20,493 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 14:47:20,493 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:20,493 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363513717] [2021-06-05 14:47:20,493 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363513717] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:20,493 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:20,494 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:20,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563485587] [2021-06-05 14:47:20,494 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:20,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:20,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:20,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:20,494 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 14:47:20,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:20,597 INFO L93 Difference]: Finished difference Result 401 states and 1166 transitions. [2021-06-05 14:47:20,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:20,598 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 14:47:20,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:20,598 INFO L225 Difference]: With dead ends: 401 [2021-06-05 14:47:20,598 INFO L226 Difference]: Without dead ends: 395 [2021-06-05 14:47:20,598 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 78.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:20,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-06-05 14:47:20,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 277. [2021-06-05 14:47:20,601 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 14:47:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 837 transitions. [2021-06-05 14:47:20,601 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 837 transitions. Word has length 19 [2021-06-05 14:47:20,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:20,602 INFO L482 AbstractCegarLoop]: Abstraction has 277 states and 837 transitions. [2021-06-05 14:47:20,602 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 14:47:20,602 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 837 transitions. [2021-06-05 14:47:20,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:20,602 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:20,602 INFO L521 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 14:47:20,602 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable580 [2021-06-05 14:47:20,602 INFO L430 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:20,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:20,602 INFO L82 PathProgramCache]: Analyzing trace with hash -114432569, now seen corresponding path program 30 times [2021-06-05 14:47:20,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:20,602 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754336587] [2021-06-05 14:47:20,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:20,630 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 14:47:20,630 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:20,630 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754336587] [2021-06-05 14:47:20,630 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754336587] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:20,630 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:20,631 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:20,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919891224] [2021-06-05 14:47:20,631 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:20,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:20,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:20,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:20,631 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 14:47:20,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:20,725 INFO L93 Difference]: Finished difference Result 379 states and 1129 transitions. [2021-06-05 14:47:20,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:20,726 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 14:47:20,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:20,726 INFO L225 Difference]: With dead ends: 379 [2021-06-05 14:47:20,726 INFO L226 Difference]: Without dead ends: 379 [2021-06-05 14:47:20,726 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 64.8ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:20,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-06-05 14:47:20,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 255. [2021-06-05 14:47:20,729 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 14:47:20,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 770 transitions. [2021-06-05 14:47:20,729 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 770 transitions. Word has length 19 [2021-06-05 14:47:20,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:20,729 INFO L482 AbstractCegarLoop]: Abstraction has 255 states and 770 transitions. [2021-06-05 14:47:20,729 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 14:47:20,729 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 770 transitions. [2021-06-05 14:47:20,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:20,730 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:20,730 INFO L521 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 14:47:20,730 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable581 [2021-06-05 14:47:20,730 INFO L430 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:20,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:20,730 INFO L82 PathProgramCache]: Analyzing trace with hash 401252280, now seen corresponding path program 31 times [2021-06-05 14:47:20,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:20,730 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398520096] [2021-06-05 14:47:20,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:20,752 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 14:47:20,752 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:20,752 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398520096] [2021-06-05 14:47:20,753 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398520096] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:20,753 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736410277] [2021-06-05 14:47:20,753 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 14:47:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:20,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:20,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:20,817 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 14:47:20,817 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736410277] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:20,817 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:20,817 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:20,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644093849] [2021-06-05 14:47:20,818 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:20,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:20,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:20,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:20,818 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 14:47:20,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:20,881 INFO L93 Difference]: Finished difference Result 485 states and 1377 transitions. [2021-06-05 14:47:20,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:20,882 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 14:47:20,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:20,882 INFO L225 Difference]: With dead ends: 485 [2021-06-05 14:47:20,882 INFO L226 Difference]: Without dead ends: 461 [2021-06-05 14:47:20,882 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 54.6ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:20,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-06-05 14:47:20,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 255. [2021-06-05 14:47:20,885 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 14:47:20,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 763 transitions. [2021-06-05 14:47:20,886 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 763 transitions. Word has length 19 [2021-06-05 14:47:20,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:20,886 INFO L482 AbstractCegarLoop]: Abstraction has 255 states and 763 transitions. [2021-06-05 14:47:20,886 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 14:47:20,886 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 763 transitions. [2021-06-05 14:47:20,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:20,886 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:20,886 INFO L521 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 14:47:21,086 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable582,143 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:21,087 INFO L430 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:21,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:21,087 INFO L82 PathProgramCache]: Analyzing trace with hash 317204657, now seen corresponding path program 31 times [2021-06-05 14:47:21,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:21,087 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752565674] [2021-06-05 14:47:21,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:21,111 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 14:47:21,111 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:21,111 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752565674] [2021-06-05 14:47:21,112 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752565674] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:21,112 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726896288] [2021-06-05 14:47:21,112 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 14:47:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:21,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:21,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:21,170 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 14:47:21,171 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726896288] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:21,171 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:21,171 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:47:21,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14807011] [2021-06-05 14:47:21,171 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:47:21,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:21,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:47:21,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:47:21,171 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 14:47:21,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:21,244 INFO L93 Difference]: Finished difference Result 428 states and 1251 transitions. [2021-06-05 14:47:21,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:21,244 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 14:47:21,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:21,245 INFO L225 Difference]: With dead ends: 428 [2021-06-05 14:47:21,245 INFO L226 Difference]: Without dead ends: 428 [2021-06-05 14:47:21,245 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 47.2ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:21,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-06-05 14:47:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 255. [2021-06-05 14:47:21,248 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 14:47:21,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 763 transitions. [2021-06-05 14:47:21,248 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 763 transitions. Word has length 19 [2021-06-05 14:47:21,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:21,248 INFO L482 AbstractCegarLoop]: Abstraction has 255 states and 763 transitions. [2021-06-05 14:47:21,248 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 14:47:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 763 transitions. [2021-06-05 14:47:21,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:21,248 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:21,248 INFO L521 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 14:47:21,453 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 144 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable585 [2021-06-05 14:47:21,453 INFO L430 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:21,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:21,454 INFO L82 PathProgramCache]: Analyzing trace with hash -27612327, now seen corresponding path program 32 times [2021-06-05 14:47:21,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:21,454 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506878656] [2021-06-05 14:47:21,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:21,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 14:47:21,476 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:21,476 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506878656] [2021-06-05 14:47:21,476 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506878656] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:21,476 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905645121] [2021-06-05 14:47:21,476 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 14:47:21,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:21,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:21,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:21,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:21,537 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 14:47:21,537 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905645121] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:21,537 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:21,537 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:21,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433628562] [2021-06-05 14:47:21,537 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:21,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:21,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:21,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:21,538 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 14:47:21,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:21,603 INFO L93 Difference]: Finished difference Result 425 states and 1238 transitions. [2021-06-05 14:47:21,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:21,604 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 14:47:21,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:21,604 INFO L225 Difference]: With dead ends: 425 [2021-06-05 14:47:21,604 INFO L226 Difference]: Without dead ends: 417 [2021-06-05 14:47:21,604 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 50.5ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:21,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2021-06-05 14:47:21,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 271. [2021-06-05 14:47:21,607 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 14:47:21,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 819 transitions. [2021-06-05 14:47:21,607 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 819 transitions. Word has length 19 [2021-06-05 14:47:21,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:21,608 INFO L482 AbstractCegarLoop]: Abstraction has 271 states and 819 transitions. [2021-06-05 14:47:21,608 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 14:47:21,608 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 819 transitions. [2021-06-05 14:47:21,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:21,608 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:21,608 INFO L521 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 14:47:21,808 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 145 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable586 [2021-06-05 14:47:21,808 INFO L430 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:21,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:21,809 INFO L82 PathProgramCache]: Analyzing trace with hash 4334626, now seen corresponding path program 32 times [2021-06-05 14:47:21,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:21,809 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706501004] [2021-06-05 14:47:21,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:21,837 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 14:47:21,837 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:21,837 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706501004] [2021-06-05 14:47:21,837 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706501004] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:21,837 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108644180] [2021-06-05 14:47:21,837 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 14:47:21,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:21,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:21,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:21,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:21,918 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 14:47:21,918 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108644180] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:21,918 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:21,918 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:21,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028018562] [2021-06-05 14:47:21,918 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:21,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:21,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:21,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:21,919 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 14:47:22,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:22,008 INFO L93 Difference]: Finished difference Result 489 states and 1412 transitions. [2021-06-05 14:47:22,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:22,009 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 14:47:22,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:22,009 INFO L225 Difference]: With dead ends: 489 [2021-06-05 14:47:22,009 INFO L226 Difference]: Without dead ends: 489 [2021-06-05 14:47:22,009 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 86.1ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:47:22,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2021-06-05 14:47:22,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 271. [2021-06-05 14:47:22,012 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 14:47:22,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 819 transitions. [2021-06-05 14:47:22,013 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 819 transitions. Word has length 19 [2021-06-05 14:47:22,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:22,013 INFO L482 AbstractCegarLoop]: Abstraction has 271 states and 819 transitions. [2021-06-05 14:47:22,013 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 14:47:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 819 transitions. [2021-06-05 14:47:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:22,013 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:22,013 INFO L521 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 14:47:22,214 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable589,146 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:22,214 INFO L430 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:22,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:22,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1867633454, now seen corresponding path program 33 times [2021-06-05 14:47:22,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:22,214 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867095149] [2021-06-05 14:47:22,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:22,242 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 14:47:22,242 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:22,242 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867095149] [2021-06-05 14:47:22,242 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867095149] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:22,242 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030146764] [2021-06-05 14:47:22,243 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 14:47:22,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:47:22,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:22,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:22,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:22,317 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 14:47:22,317 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030146764] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:22,317 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:22,317 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:22,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792191659] [2021-06-05 14:47:22,317 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:22,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:22,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:22,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:22,317 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 14:47:22,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:22,397 INFO L93 Difference]: Finished difference Result 498 states and 1425 transitions. [2021-06-05 14:47:22,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:22,397 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 14:47:22,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:22,398 INFO L225 Difference]: With dead ends: 498 [2021-06-05 14:47:22,398 INFO L226 Difference]: Without dead ends: 489 [2021-06-05 14:47:22,398 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 67.3ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:47:22,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2021-06-05 14:47:22,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 271. [2021-06-05 14:47:22,401 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 14:47:22,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 815 transitions. [2021-06-05 14:47:22,401 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 815 transitions. Word has length 19 [2021-06-05 14:47:22,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:22,401 INFO L482 AbstractCegarLoop]: Abstraction has 271 states and 815 transitions. [2021-06-05 14:47:22,401 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 14:47:22,401 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 815 transitions. [2021-06-05 14:47:22,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:22,402 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:22,402 INFO L521 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 14:47:22,602 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 147 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable590 [2021-06-05 14:47:22,602 INFO L430 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:22,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:22,602 INFO L82 PathProgramCache]: Analyzing trace with hash 451672349, now seen corresponding path program 33 times [2021-06-05 14:47:22,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:22,603 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017758304] [2021-06-05 14:47:22,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:22,627 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 14:47:22,627 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:22,627 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017758304] [2021-06-05 14:47:22,627 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017758304] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:22,627 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77059272] [2021-06-05 14:47:22,627 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 14:47:22,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:47:22,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:22,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:22,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:22,688 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 14:47:22,688 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77059272] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:22,688 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:22,688 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:22,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264460164] [2021-06-05 14:47:22,688 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:22,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:22,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:22,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:22,688 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 14:47:22,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:22,757 INFO L93 Difference]: Finished difference Result 447 states and 1310 transitions. [2021-06-05 14:47:22,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:22,757 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 14:47:22,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:22,758 INFO L225 Difference]: With dead ends: 447 [2021-06-05 14:47:22,758 INFO L226 Difference]: Without dead ends: 447 [2021-06-05 14:47:22,758 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 53.6ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:22,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2021-06-05 14:47:22,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 260. [2021-06-05 14:47:22,761 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 14:47:22,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 782 transitions. [2021-06-05 14:47:22,761 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 782 transitions. Word has length 19 [2021-06-05 14:47:22,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:22,761 INFO L482 AbstractCegarLoop]: Abstraction has 260 states and 782 transitions. [2021-06-05 14:47:22,761 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 14:47:22,761 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 782 transitions. [2021-06-05 14:47:22,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:22,761 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:22,762 INFO L521 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 14:47:22,962 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable593,148 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:22,962 INFO L430 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:22,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:22,962 INFO L82 PathProgramCache]: Analyzing trace with hash 256701904, now seen corresponding path program 34 times [2021-06-05 14:47:22,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:22,962 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17479612] [2021-06-05 14:47:22,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:22,985 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 14:47:22,985 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:22,985 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17479612] [2021-06-05 14:47:22,985 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17479612] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:22,986 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:22,986 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:22,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679408266] [2021-06-05 14:47:22,986 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:22,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:22,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:22,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:22,986 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 14:47:23,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:23,044 INFO L93 Difference]: Finished difference Result 556 states and 1559 transitions. [2021-06-05 14:47:23,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:23,045 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 14:47:23,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:23,045 INFO L225 Difference]: With dead ends: 556 [2021-06-05 14:47:23,045 INFO L226 Difference]: Without dead ends: 532 [2021-06-05 14:47:23,045 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 34.2ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:23,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-06-05 14:47:23,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 264. [2021-06-05 14:47:23,049 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 14:47:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 788 transitions. [2021-06-05 14:47:23,049 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 788 transitions. Word has length 19 [2021-06-05 14:47:23,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:23,049 INFO L482 AbstractCegarLoop]: Abstraction has 264 states and 788 transitions. [2021-06-05 14:47:23,049 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 14:47:23,049 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 788 transitions. [2021-06-05 14:47:23,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:23,049 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:23,049 INFO L521 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 14:47:23,050 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable594 [2021-06-05 14:47:23,050 INFO L430 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:23,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:23,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2084615198, now seen corresponding path program 35 times [2021-06-05 14:47:23,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:23,050 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498847276] [2021-06-05 14:47:23,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:23,073 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 14:47:23,073 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:23,073 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498847276] [2021-06-05 14:47:23,073 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498847276] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:23,074 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:23,074 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:23,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610652386] [2021-06-05 14:47:23,074 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:23,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:23,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:23,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:23,074 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 14:47:23,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:23,136 INFO L93 Difference]: Finished difference Result 540 states and 1513 transitions. [2021-06-05 14:47:23,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:23,136 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 14:47:23,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:23,137 INFO L225 Difference]: With dead ends: 540 [2021-06-05 14:47:23,137 INFO L226 Difference]: Without dead ends: 534 [2021-06-05 14:47:23,137 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 39.5ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:23,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2021-06-05 14:47:23,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 274. [2021-06-05 14:47:23,140 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 14:47:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 813 transitions. [2021-06-05 14:47:23,141 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 813 transitions. Word has length 19 [2021-06-05 14:47:23,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:23,141 INFO L482 AbstractCegarLoop]: Abstraction has 274 states and 813 transitions. [2021-06-05 14:47:23,141 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 14:47:23,141 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 813 transitions. [2021-06-05 14:47:23,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:23,141 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:23,141 INFO L521 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 14:47:23,141 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable595 [2021-06-05 14:47:23,141 INFO L430 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:23,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:23,142 INFO L82 PathProgramCache]: Analyzing trace with hash -180498166, now seen corresponding path program 36 times [2021-06-05 14:47:23,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:23,142 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885664943] [2021-06-05 14:47:23,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:23,176 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 14:47:23,176 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:23,176 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885664943] [2021-06-05 14:47:23,176 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885664943] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:23,176 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:23,176 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:23,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369995877] [2021-06-05 14:47:23,176 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:23,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:23,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:23,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:23,177 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 14:47:23,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:23,251 INFO L93 Difference]: Finished difference Result 504 states and 1430 transitions. [2021-06-05 14:47:23,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:23,251 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 14:47:23,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:23,251 INFO L225 Difference]: With dead ends: 504 [2021-06-05 14:47:23,251 INFO L226 Difference]: Without dead ends: 489 [2021-06-05 14:47:23,252 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 47.3ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:23,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2021-06-05 14:47:23,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 260. [2021-06-05 14:47:23,255 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 14:47:23,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 780 transitions. [2021-06-05 14:47:23,255 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 780 transitions. Word has length 19 [2021-06-05 14:47:23,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:23,255 INFO L482 AbstractCegarLoop]: Abstraction has 260 states and 780 transitions. [2021-06-05 14:47:23,255 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 14:47:23,255 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 780 transitions. [2021-06-05 14:47:23,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:23,255 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:23,255 INFO L521 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 14:47:23,256 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable596 [2021-06-05 14:47:23,256 INFO L430 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:23,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:23,256 INFO L82 PathProgramCache]: Analyzing trace with hash -136390839, now seen corresponding path program 34 times [2021-06-05 14:47:23,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:23,256 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672869412] [2021-06-05 14:47:23,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:23,279 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 14:47:23,279 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:23,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672869412] [2021-06-05 14:47:23,279 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672869412] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:23,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838794020] [2021-06-05 14:47:23,279 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 14:47:23,304 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:47:23,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:23,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:23,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:23,344 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 14:47:23,344 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838794020] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:23,344 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:23,344 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:47:23,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737631624] [2021-06-05 14:47:23,344 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:47:23,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:23,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:47:23,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:47:23,344 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 14:47:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:23,422 INFO L93 Difference]: Finished difference Result 588 states and 1723 transitions. [2021-06-05 14:47:23,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:23,423 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 14:47:23,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:23,423 INFO L225 Difference]: With dead ends: 588 [2021-06-05 14:47:23,423 INFO L226 Difference]: Without dead ends: 588 [2021-06-05 14:47:23,423 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 47.0ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:23,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2021-06-05 14:47:23,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 266. [2021-06-05 14:47:23,427 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 14:47:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 798 transitions. [2021-06-05 14:47:23,427 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 798 transitions. Word has length 19 [2021-06-05 14:47:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:23,427 INFO L482 AbstractCegarLoop]: Abstraction has 266 states and 798 transitions. [2021-06-05 14:47:23,427 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 14:47:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 798 transitions. [2021-06-05 14:47:23,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:23,427 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:23,427 INFO L521 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 14:47:23,628 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 149 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable597 [2021-06-05 14:47:23,628 INFO L430 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:23,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:23,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1036563747, now seen corresponding path program 35 times [2021-06-05 14:47:23,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:23,628 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116300076] [2021-06-05 14:47:23,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:23,650 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 14:47:23,651 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:23,651 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116300076] [2021-06-05 14:47:23,651 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116300076] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:23,651 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316582853] [2021-06-05 14:47:23,651 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 14:47:23,675 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:23,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:23,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:23,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:23,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 14:47:23,719 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316582853] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:23,719 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:23,719 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:23,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801092247] [2021-06-05 14:47:23,719 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:23,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:23,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:23,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:23,719 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 14:47:23,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:23,787 INFO L93 Difference]: Finished difference Result 527 states and 1532 transitions. [2021-06-05 14:47:23,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:23,787 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 14:47:23,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:23,788 INFO L225 Difference]: With dead ends: 527 [2021-06-05 14:47:23,788 INFO L226 Difference]: Without dead ends: 521 [2021-06-05 14:47:23,788 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 49.0ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:23,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-06-05 14:47:23,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 278. [2021-06-05 14:47:23,796 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 14:47:23,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 837 transitions. [2021-06-05 14:47:23,796 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 837 transitions. Word has length 19 [2021-06-05 14:47:23,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:23,797 INFO L482 AbstractCegarLoop]: Abstraction has 278 states and 837 transitions. [2021-06-05 14:47:23,797 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 14:47:23,797 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 837 transitions. [2021-06-05 14:47:23,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:23,797 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:23,797 INFO L521 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 14:47:23,997 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 150 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable598 [2021-06-05 14:47:23,998 INFO L430 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:23,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:23,998 INFO L82 PathProgramCache]: Analyzing trace with hash 2043043929, now seen corresponding path program 36 times [2021-06-05 14:47:23,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:23,998 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443807065] [2021-06-05 14:47:23,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:24,037 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 14:47:24,037 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:24,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443807065] [2021-06-05 14:47:24,037 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443807065] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:24,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025369534] [2021-06-05 14:47:24,037 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 14:47:24,063 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:47:24,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:24,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:24,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:24,098 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 14:47:24,098 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025369534] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:24,098 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:24,098 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:24,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021511103] [2021-06-05 14:47:24,099 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:24,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:24,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:24,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:24,099 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 14:47:24,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:24,168 INFO L93 Difference]: Finished difference Result 505 states and 1485 transitions. [2021-06-05 14:47:24,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:24,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 14:47:24,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:24,169 INFO L225 Difference]: With dead ends: 505 [2021-06-05 14:47:24,169 INFO L226 Difference]: Without dead ends: 505 [2021-06-05 14:47:24,169 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 61.0ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:24,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-06-05 14:47:24,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 260. [2021-06-05 14:47:24,172 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 14:47:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 780 transitions. [2021-06-05 14:47:24,173 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 780 transitions. Word has length 19 [2021-06-05 14:47:24,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:24,173 INFO L482 AbstractCegarLoop]: Abstraction has 260 states and 780 transitions. [2021-06-05 14:47:24,173 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 14:47:24,173 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 780 transitions. [2021-06-05 14:47:24,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:24,173 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:24,173 INFO L521 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 14:47:24,373 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 151 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable601 [2021-06-05 14:47:24,373 INFO L430 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:24,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:24,374 INFO L82 PathProgramCache]: Analyzing trace with hash -695873807, now seen corresponding path program 37 times [2021-06-05 14:47:24,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:24,374 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168681187] [2021-06-05 14:47:24,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:24,396 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 14:47:24,396 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:24,396 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168681187] [2021-06-05 14:47:24,396 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168681187] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:24,396 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:24,396 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:24,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559125597] [2021-06-05 14:47:24,397 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:24,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:24,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:24,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:24,397 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 14:47:24,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:24,464 INFO L93 Difference]: Finished difference Result 507 states and 1464 transitions. [2021-06-05 14:47:24,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:24,464 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 14:47:24,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:24,465 INFO L225 Difference]: With dead ends: 507 [2021-06-05 14:47:24,465 INFO L226 Difference]: Without dead ends: 499 [2021-06-05 14:47:24,465 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 38.8ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:24,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2021-06-05 14:47:24,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 272. [2021-06-05 14:47:24,468 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 14:47:24,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 826 transitions. [2021-06-05 14:47:24,469 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 826 transitions. Word has length 19 [2021-06-05 14:47:24,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:24,469 INFO L482 AbstractCegarLoop]: Abstraction has 272 states and 826 transitions. [2021-06-05 14:47:24,469 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 14:47:24,469 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 826 transitions. [2021-06-05 14:47:24,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:24,469 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:24,469 INFO L521 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 14:47:24,469 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable602 [2021-06-05 14:47:24,469 INFO L430 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:24,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:24,470 INFO L82 PathProgramCache]: Analyzing trace with hash -315136167, now seen corresponding path program 38 times [2021-06-05 14:47:24,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:24,470 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637249628] [2021-06-05 14:47:24,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:24,497 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 14:47:24,497 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:24,497 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637249628] [2021-06-05 14:47:24,497 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637249628] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:24,497 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:24,497 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:24,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17698513] [2021-06-05 14:47:24,498 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:24,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:24,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:24,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:24,498 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 14:47:24,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:24,574 INFO L93 Difference]: Finished difference Result 497 states and 1439 transitions. [2021-06-05 14:47:24,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:24,574 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 14:47:24,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:24,575 INFO L225 Difference]: With dead ends: 497 [2021-06-05 14:47:24,575 INFO L226 Difference]: Without dead ends: 489 [2021-06-05 14:47:24,575 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 43.0ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:24,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2021-06-05 14:47:24,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 276. [2021-06-05 14:47:24,581 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 14:47:24,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 835 transitions. [2021-06-05 14:47:24,581 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 835 transitions. Word has length 19 [2021-06-05 14:47:24,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:24,581 INFO L482 AbstractCegarLoop]: Abstraction has 276 states and 835 transitions. [2021-06-05 14:47:24,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 14:47:24,581 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 835 transitions. [2021-06-05 14:47:24,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:24,582 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:24,582 INFO L521 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 14:47:24,582 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable603 [2021-06-05 14:47:24,582 INFO L430 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:24,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:24,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1236489122, now seen corresponding path program 37 times [2021-06-05 14:47:24,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:24,582 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145197886] [2021-06-05 14:47:24,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:24,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 14:47:24,615 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:24,615 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145197886] [2021-06-05 14:47:24,615 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145197886] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:24,616 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47481875] [2021-06-05 14:47:24,616 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 14:47:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:24,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:24,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:24,695 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 14:47:24,696 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47481875] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:24,696 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:24,696 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:24,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408490165] [2021-06-05 14:47:24,696 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:24,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:24,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:24,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:24,696 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 14:47:24,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:24,780 INFO L93 Difference]: Finished difference Result 591 states and 1709 transitions. [2021-06-05 14:47:24,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:24,780 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 14:47:24,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:24,781 INFO L225 Difference]: With dead ends: 591 [2021-06-05 14:47:24,781 INFO L226 Difference]: Without dead ends: 591 [2021-06-05 14:47:24,781 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 72.9ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:24,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2021-06-05 14:47:24,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 282. [2021-06-05 14:47:24,784 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 14:47:24,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 862 transitions. [2021-06-05 14:47:24,785 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 862 transitions. Word has length 19 [2021-06-05 14:47:24,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:24,785 INFO L482 AbstractCegarLoop]: Abstraction has 282 states and 862 transitions. [2021-06-05 14:47:24,785 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 14:47:24,785 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 862 transitions. [2021-06-05 14:47:24,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:24,789 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:24,789 INFO L521 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 14:47:25,004 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 152 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable604 [2021-06-05 14:47:25,005 INFO L430 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:25,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:25,005 INFO L82 PathProgramCache]: Analyzing trace with hash -2128316998, now seen corresponding path program 38 times [2021-06-05 14:47:25,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:25,005 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009938611] [2021-06-05 14:47:25,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:25,031 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 14:47:25,031 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:25,031 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009938611] [2021-06-05 14:47:25,031 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009938611] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:25,031 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233896097] [2021-06-05 14:47:25,031 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 14:47:25,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:25,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:25,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:25,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:25,106 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 14:47:25,107 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233896097] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:25,107 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:25,107 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:25,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975189820] [2021-06-05 14:47:25,107 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:25,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:25,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:25,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:25,107 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 14:47:25,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:25,187 INFO L93 Difference]: Finished difference Result 573 states and 1640 transitions. [2021-06-05 14:47:25,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:25,188 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 14:47:25,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:25,188 INFO L225 Difference]: With dead ends: 573 [2021-06-05 14:47:25,188 INFO L226 Difference]: Without dead ends: 567 [2021-06-05 14:47:25,188 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 63.3ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:25,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-06-05 14:47:25,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 281. [2021-06-05 14:47:25,192 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 14:47:25,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 857 transitions. [2021-06-05 14:47:25,192 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 857 transitions. Word has length 19 [2021-06-05 14:47:25,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:25,192 INFO L482 AbstractCegarLoop]: Abstraction has 281 states and 857 transitions. [2021-06-05 14:47:25,192 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 14:47:25,192 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 857 transitions. [2021-06-05 14:47:25,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:25,193 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:25,193 INFO L521 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 14:47:25,393 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable605,153 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:25,393 INFO L430 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:25,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:25,393 INFO L82 PathProgramCache]: Analyzing trace with hash -900007947, now seen corresponding path program 39 times [2021-06-05 14:47:25,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:25,394 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069834294] [2021-06-05 14:47:25,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:25,417 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 14:47:25,417 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:25,417 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069834294] [2021-06-05 14:47:25,417 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069834294] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:25,417 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639047342] [2021-06-05 14:47:25,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 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 14:47:25,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:47:25,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:25,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:25,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:25,498 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 14:47:25,498 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639047342] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:25,498 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:25,498 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:25,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998349230] [2021-06-05 14:47:25,499 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:25,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:25,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:25,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:25,499 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 14:47:25,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:25,562 INFO L93 Difference]: Finished difference Result 558 states and 1599 transitions. [2021-06-05 14:47:25,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:25,562 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 14:47:25,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:25,563 INFO L225 Difference]: With dead ends: 558 [2021-06-05 14:47:25,563 INFO L226 Difference]: Without dead ends: 550 [2021-06-05 14:47:25,563 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 61.1ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:25,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-06-05 14:47:25,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 281. [2021-06-05 14:47:25,569 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 14:47:25,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 860 transitions. [2021-06-05 14:47:25,570 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 860 transitions. Word has length 19 [2021-06-05 14:47:25,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:25,570 INFO L482 AbstractCegarLoop]: Abstraction has 281 states and 860 transitions. [2021-06-05 14:47:25,570 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 14:47:25,570 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 860 transitions. [2021-06-05 14:47:25,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:25,570 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:25,570 INFO L521 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 14:47:25,780 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable608,154 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:25,781 INFO L430 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:25,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:25,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1436888778, now seen corresponding path program 39 times [2021-06-05 14:47:25,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:25,781 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310952219] [2021-06-05 14:47:25,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:25,809 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 14:47:25,810 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:25,810 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310952219] [2021-06-05 14:47:25,810 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310952219] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:25,810 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682934769] [2021-06-05 14:47:25,810 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 14:47:25,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:47:25,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:25,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:25,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:25,887 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 14:47:25,887 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682934769] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:25,887 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:25,887 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:25,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821461936] [2021-06-05 14:47:25,887 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:25,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:25,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:25,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:25,888 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 14:47:25,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:25,968 INFO L93 Difference]: Finished difference Result 621 states and 1765 transitions. [2021-06-05 14:47:25,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:25,968 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 14:47:25,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:25,969 INFO L225 Difference]: With dead ends: 621 [2021-06-05 14:47:25,969 INFO L226 Difference]: Without dead ends: 621 [2021-06-05 14:47:25,969 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 67.6ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:25,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2021-06-05 14:47:25,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 272. [2021-06-05 14:47:25,972 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 14:47:25,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 830 transitions. [2021-06-05 14:47:25,978 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 830 transitions. Word has length 19 [2021-06-05 14:47:25,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:25,978 INFO L482 AbstractCegarLoop]: Abstraction has 272 states and 830 transitions. [2021-06-05 14:47:25,978 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 14:47:25,978 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 830 transitions. [2021-06-05 14:47:25,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:25,978 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:25,978 INFO L521 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 14:47:26,184 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 155 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable611 [2021-06-05 14:47:26,185 INFO L430 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:26,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:26,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1355648106, now seen corresponding path program 40 times [2021-06-05 14:47:26,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:26,185 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801340280] [2021-06-05 14:47:26,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:26,212 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 14:47:26,212 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:26,212 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801340280] [2021-06-05 14:47:26,212 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801340280] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:26,212 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287021159] [2021-06-05 14:47:26,212 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 14:47:26,236 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:47:26,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:26,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:26,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:26,287 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 14:47:26,287 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287021159] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:26,288 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:26,288 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:26,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617593494] [2021-06-05 14:47:26,288 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:26,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:26,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:26,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:26,288 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 14:47:26,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:26,375 INFO L93 Difference]: Finished difference Result 576 states and 1637 transitions. [2021-06-05 14:47:26,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:26,375 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 14:47:26,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:26,376 INFO L225 Difference]: With dead ends: 576 [2021-06-05 14:47:26,376 INFO L226 Difference]: Without dead ends: 567 [2021-06-05 14:47:26,376 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 62.7ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:26,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-06-05 14:47:26,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 272. [2021-06-05 14:47:26,379 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 14:47:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 826 transitions. [2021-06-05 14:47:26,380 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 826 transitions. Word has length 19 [2021-06-05 14:47:26,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:26,380 INFO L482 AbstractCegarLoop]: Abstraction has 272 states and 826 transitions. [2021-06-05 14:47:26,380 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 14:47:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 826 transitions. [2021-06-05 14:47:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:26,380 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:26,380 INFO L521 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 14:47:26,581 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable612,156 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:26,581 INFO L430 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:26,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:26,581 INFO L82 PathProgramCache]: Analyzing trace with hash -620013387, now seen corresponding path program 40 times [2021-06-05 14:47:26,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:26,581 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139807699] [2021-06-05 14:47:26,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:26,607 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 14:47:26,607 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:26,607 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139807699] [2021-06-05 14:47:26,607 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139807699] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:26,607 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376041047] [2021-06-05 14:47:26,607 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 14:47:26,632 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:47:26,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:26,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:26,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:26,675 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 14:47:26,675 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376041047] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:26,675 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:26,675 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:26,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467121828] [2021-06-05 14:47:26,676 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:26,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:26,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:26,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:26,676 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 14:47:26,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:26,759 INFO L93 Difference]: Finished difference Result 530 states and 1549 transitions. [2021-06-05 14:47:26,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:26,759 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 14:47:26,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:26,760 INFO L225 Difference]: With dead ends: 530 [2021-06-05 14:47:26,760 INFO L226 Difference]: Without dead ends: 530 [2021-06-05 14:47:26,760 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 56.6ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:26,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-06-05 14:47:26,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 264. [2021-06-05 14:47:26,763 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 14:47:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 794 transitions. [2021-06-05 14:47:26,764 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 794 transitions. Word has length 19 [2021-06-05 14:47:26,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:26,764 INFO L482 AbstractCegarLoop]: Abstraction has 264 states and 794 transitions. [2021-06-05 14:47:26,764 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 14:47:26,764 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 794 transitions. [2021-06-05 14:47:26,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:26,764 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:26,764 INFO L521 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 14:47:26,980 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable615,157 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:26,980 INFO L430 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:26,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:26,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1979491946, now seen corresponding path program 41 times [2021-06-05 14:47:26,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:26,981 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867011532] [2021-06-05 14:47:26,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:27,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 14:47:27,005 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:27,005 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867011532] [2021-06-05 14:47:27,005 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867011532] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:27,005 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:27,005 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:27,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260414982] [2021-06-05 14:47:27,005 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:27,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:27,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:27,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:27,006 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 14:47:27,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:27,068 INFO L93 Difference]: Finished difference Result 551 states and 1548 transitions. [2021-06-05 14:47:27,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:27,068 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 14:47:27,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:27,069 INFO L225 Difference]: With dead ends: 551 [2021-06-05 14:47:27,069 INFO L226 Difference]: Without dead ends: 545 [2021-06-05 14:47:27,069 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 37.7ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:27,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-06-05 14:47:27,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 274. [2021-06-05 14:47:27,072 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 14:47:27,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 819 transitions. [2021-06-05 14:47:27,072 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 819 transitions. Word has length 19 [2021-06-05 14:47:27,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:27,072 INFO L482 AbstractCegarLoop]: Abstraction has 274 states and 819 transitions. [2021-06-05 14:47:27,072 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 14:47:27,073 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 819 transitions. [2021-06-05 14:47:27,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:27,073 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:27,073 INFO L521 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 14:47:27,073 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable616 [2021-06-05 14:47:27,073 INFO L430 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:27,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:27,073 INFO L82 PathProgramCache]: Analyzing trace with hash 877577794, now seen corresponding path program 42 times [2021-06-05 14:47:27,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:27,073 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886376313] [2021-06-05 14:47:27,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:27,097 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 14:47:27,097 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:27,097 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886376313] [2021-06-05 14:47:27,097 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886376313] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:27,097 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:27,098 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:27,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47538816] [2021-06-05 14:47:27,098 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:27,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:27,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:27,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:27,098 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 14:47:27,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:27,157 INFO L93 Difference]: Finished difference Result 515 states and 1465 transitions. [2021-06-05 14:47:27,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:27,158 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 14:47:27,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:27,158 INFO L225 Difference]: With dead ends: 515 [2021-06-05 14:47:27,158 INFO L226 Difference]: Without dead ends: 504 [2021-06-05 14:47:27,158 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 37.7ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:27,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2021-06-05 14:47:27,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 264. [2021-06-05 14:47:27,161 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 14:47:27,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 793 transitions. [2021-06-05 14:47:27,162 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 793 transitions. Word has length 19 [2021-06-05 14:47:27,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:27,162 INFO L482 AbstractCegarLoop]: Abstraction has 264 states and 793 transitions. [2021-06-05 14:47:27,162 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 14:47:27,162 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 793 transitions. [2021-06-05 14:47:27,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:27,162 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:27,162 INFO L521 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 14:47:27,162 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable617 [2021-06-05 14:47:27,162 INFO L430 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:27,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:27,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1591463139, now seen corresponding path program 41 times [2021-06-05 14:47:27,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:27,163 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153150126] [2021-06-05 14:47:27,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:27,186 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 14:47:27,186 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:27,186 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153150126] [2021-06-05 14:47:27,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153150126] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:27,186 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:27,186 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:27,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269362131] [2021-06-05 14:47:27,186 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:27,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:27,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:27,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:27,186 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 14:47:27,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:27,259 INFO L93 Difference]: Finished difference Result 504 states and 1450 transitions. [2021-06-05 14:47:27,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:27,259 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 14:47:27,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:27,260 INFO L225 Difference]: With dead ends: 504 [2021-06-05 14:47:27,260 INFO L226 Difference]: Without dead ends: 498 [2021-06-05 14:47:27,260 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 40.2ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:27,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2021-06-05 14:47:27,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 276. [2021-06-05 14:47:27,263 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 14:47:27,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 830 transitions. [2021-06-05 14:47:27,264 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 830 transitions. Word has length 19 [2021-06-05 14:47:27,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:27,264 INFO L482 AbstractCegarLoop]: Abstraction has 276 states and 830 transitions. [2021-06-05 14:47:27,264 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 14:47:27,264 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 830 transitions. [2021-06-05 14:47:27,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:27,264 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:27,264 INFO L521 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 14:47:27,264 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable618 [2021-06-05 14:47:27,264 INFO L430 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:27,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:27,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1320953447, now seen corresponding path program 42 times [2021-06-05 14:47:27,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:27,265 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131287412] [2021-06-05 14:47:27,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:27,290 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 14:47:27,290 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:27,290 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131287412] [2021-06-05 14:47:27,290 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131287412] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:27,290 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:27,290 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:27,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012129009] [2021-06-05 14:47:27,291 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:27,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:27,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:27,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:27,291 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 14:47:27,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:27,369 INFO L93 Difference]: Finished difference Result 482 states and 1413 transitions. [2021-06-05 14:47:27,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:27,369 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 14:47:27,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:27,370 INFO L225 Difference]: With dead ends: 482 [2021-06-05 14:47:27,370 INFO L226 Difference]: Without dead ends: 482 [2021-06-05 14:47:27,370 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 42.0ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:27,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-06-05 14:47:27,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 261. [2021-06-05 14:47:27,373 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 14:47:27,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 784 transitions. [2021-06-05 14:47:27,373 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 784 transitions. Word has length 19 [2021-06-05 14:47:27,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:27,373 INFO L482 AbstractCegarLoop]: Abstraction has 261 states and 784 transitions. [2021-06-05 14:47:27,373 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 14:47:27,373 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 784 transitions. [2021-06-05 14:47:27,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:27,374 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:27,374 INFO L521 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 14:47:27,374 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable619 [2021-06-05 14:47:27,374 INFO L430 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:27,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:27,374 INFO L82 PathProgramCache]: Analyzing trace with hash -549537380, now seen corresponding path program 43 times [2021-06-05 14:47:27,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:27,374 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380080334] [2021-06-05 14:47:27,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:27,397 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 14:47:27,397 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:27,397 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380080334] [2021-06-05 14:47:27,397 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380080334] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:27,397 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:27,397 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:27,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489452503] [2021-06-05 14:47:27,397 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:27,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:27,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:27,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:27,398 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 14:47:27,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:27,453 INFO L93 Difference]: Finished difference Result 407 states and 1153 transitions. [2021-06-05 14:47:27,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:27,454 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 14:47:27,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:27,454 INFO L225 Difference]: With dead ends: 407 [2021-06-05 14:47:27,454 INFO L226 Difference]: Without dead ends: 383 [2021-06-05 14:47:27,454 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 41.2ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:27,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-06-05 14:47:27,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 265. [2021-06-05 14:47:27,457 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 14:47:27,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 790 transitions. [2021-06-05 14:47:27,457 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 790 transitions. Word has length 19 [2021-06-05 14:47:27,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:27,458 INFO L482 AbstractCegarLoop]: Abstraction has 265 states and 790 transitions. [2021-06-05 14:47:27,458 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 14:47:27,458 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 790 transitions. [2021-06-05 14:47:27,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:27,458 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:27,458 INFO L521 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 14:47:27,458 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable620 [2021-06-05 14:47:27,458 INFO L430 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:27,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:27,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1404112814, now seen corresponding path program 44 times [2021-06-05 14:47:27,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:27,458 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765883034] [2021-06-05 14:47:27,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:27,482 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 14:47:27,482 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:27,482 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765883034] [2021-06-05 14:47:27,482 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765883034] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:27,482 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:27,482 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:27,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463553655] [2021-06-05 14:47:27,482 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:27,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:27,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:27,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:27,482 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 14:47:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:27,554 INFO L93 Difference]: Finished difference Result 430 states and 1198 transitions. [2021-06-05 14:47:27,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:27,554 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 14:47:27,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:27,555 INFO L225 Difference]: With dead ends: 430 [2021-06-05 14:47:27,555 INFO L226 Difference]: Without dead ends: 424 [2021-06-05 14:47:27,555 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 51.1ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:27,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2021-06-05 14:47:27,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 275. [2021-06-05 14:47:27,558 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 14:47:27,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 815 transitions. [2021-06-05 14:47:27,558 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 815 transitions. Word has length 19 [2021-06-05 14:47:27,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:27,558 INFO L482 AbstractCegarLoop]: Abstraction has 275 states and 815 transitions. [2021-06-05 14:47:27,558 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 14:47:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 815 transitions. [2021-06-05 14:47:27,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:27,559 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:27,559 INFO L521 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 14:47:27,559 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable621 [2021-06-05 14:47:27,559 INFO L430 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:27,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:27,559 INFO L82 PathProgramCache]: Analyzing trace with hash -986737450, now seen corresponding path program 45 times [2021-06-05 14:47:27,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:27,559 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725754707] [2021-06-05 14:47:27,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:27,582 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 14:47:27,582 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:27,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725754707] [2021-06-05 14:47:27,582 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725754707] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:27,582 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:27,583 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:27,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470629040] [2021-06-05 14:47:27,583 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:27,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:27,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:27,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:27,583 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 14:47:27,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:27,651 INFO L93 Difference]: Finished difference Result 394 states and 1115 transitions. [2021-06-05 14:47:27,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:27,652 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 14:47:27,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:27,652 INFO L225 Difference]: With dead ends: 394 [2021-06-05 14:47:27,652 INFO L226 Difference]: Without dead ends: 379 [2021-06-05 14:47:27,652 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 54.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:27,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-06-05 14:47:27,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 261. [2021-06-05 14:47:27,655 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 14:47:27,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 780 transitions. [2021-06-05 14:47:27,655 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 780 transitions. Word has length 19 [2021-06-05 14:47:27,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:27,655 INFO L482 AbstractCegarLoop]: Abstraction has 261 states and 780 transitions. [2021-06-05 14:47:27,655 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 14:47:27,655 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 780 transitions. [2021-06-05 14:47:27,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:27,656 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:27,656 INFO L521 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 14:47:27,656 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable622 [2021-06-05 14:47:27,656 INFO L430 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:27,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:27,656 INFO L82 PathProgramCache]: Analyzing trace with hash 879484852, now seen corresponding path program 46 times [2021-06-05 14:47:27,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:27,656 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099161178] [2021-06-05 14:47:27,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:27,677 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 14:47:27,677 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:27,677 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099161178] [2021-06-05 14:47:27,677 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099161178] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:27,677 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:27,678 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:27,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999362804] [2021-06-05 14:47:27,678 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:27,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:27,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:27,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:27,678 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 14:47:27,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:27,728 INFO L93 Difference]: Finished difference Result 393 states and 1118 transitions. [2021-06-05 14:47:27,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:27,729 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 14:47:27,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:27,729 INFO L225 Difference]: With dead ends: 393 [2021-06-05 14:47:27,729 INFO L226 Difference]: Without dead ends: 381 [2021-06-05 14:47:27,729 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 40.0ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:27,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-06-05 14:47:27,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 263. [2021-06-05 14:47:27,732 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 14:47:27,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 783 transitions. [2021-06-05 14:47:27,732 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 783 transitions. Word has length 19 [2021-06-05 14:47:27,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:27,732 INFO L482 AbstractCegarLoop]: Abstraction has 263 states and 783 transitions. [2021-06-05 14:47:27,733 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 14:47:27,733 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 783 transitions. [2021-06-05 14:47:27,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:27,733 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:27,733 INFO L521 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 14:47:27,733 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable623 [2021-06-05 14:47:27,733 INFO L430 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:27,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:27,733 INFO L82 PathProgramCache]: Analyzing trace with hash 199463632, now seen corresponding path program 47 times [2021-06-05 14:47:27,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:27,733 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170117138] [2021-06-05 14:47:27,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:27,761 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 14:47:27,761 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:27,761 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170117138] [2021-06-05 14:47:27,761 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170117138] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:27,761 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:27,761 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:27,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479601479] [2021-06-05 14:47:27,761 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:27,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:27,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:27,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:27,762 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 14:47:27,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:27,830 INFO L93 Difference]: Finished difference Result 381 states and 1080 transitions. [2021-06-05 14:47:27,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:27,830 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 14:47:27,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:27,831 INFO L225 Difference]: With dead ends: 381 [2021-06-05 14:47:27,831 INFO L226 Difference]: Without dead ends: 375 [2021-06-05 14:47:27,831 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 54.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:27,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-06-05 14:47:27,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 273. [2021-06-05 14:47:27,834 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 14:47:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 808 transitions. [2021-06-05 14:47:27,834 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 808 transitions. Word has length 19 [2021-06-05 14:47:27,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:27,834 INFO L482 AbstractCegarLoop]: Abstraction has 273 states and 808 transitions. [2021-06-05 14:47:27,834 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 14:47:27,834 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 808 transitions. [2021-06-05 14:47:27,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:27,835 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:27,835 INFO L521 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 14:47:27,835 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable624 [2021-06-05 14:47:27,835 INFO L430 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:27,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:27,835 INFO L82 PathProgramCache]: Analyzing trace with hash 2103580664, now seen corresponding path program 48 times [2021-06-05 14:47:27,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:27,835 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763748077] [2021-06-05 14:47:27,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:27,860 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 14:47:27,860 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:27,860 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763748077] [2021-06-05 14:47:27,860 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763748077] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:27,860 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:27,860 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:27,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536931456] [2021-06-05 14:47:27,860 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:27,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:27,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:27,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:27,861 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 14:47:27,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:27,925 INFO L93 Difference]: Finished difference Result 345 states and 997 transitions. [2021-06-05 14:47:27,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:27,925 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 14:47:27,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:27,926 INFO L225 Difference]: With dead ends: 345 [2021-06-05 14:47:27,926 INFO L226 Difference]: Without dead ends: 328 [2021-06-05 14:47:27,926 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 50.7ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:27,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-06-05 14:47:27,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 257. [2021-06-05 14:47:27,928 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 14:47:27,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 772 transitions. [2021-06-05 14:47:27,929 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 772 transitions. Word has length 19 [2021-06-05 14:47:27,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:27,929 INFO L482 AbstractCegarLoop]: Abstraction has 257 states and 772 transitions. [2021-06-05 14:47:27,929 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 14:47:27,929 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 772 transitions. [2021-06-05 14:47:27,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:27,929 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:27,929 INFO L521 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 14:47:27,929 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable625 [2021-06-05 14:47:27,929 INFO L430 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:27,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:27,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1070480311, now seen corresponding path program 43 times [2021-06-05 14:47:27,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:27,930 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316227727] [2021-06-05 14:47:27,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:27,955 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 14:47:27,955 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:27,955 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316227727] [2021-06-05 14:47:27,955 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316227727] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:27,955 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269570058] [2021-06-05 14:47:27,955 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 14:47:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:27,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:27,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:28,012 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 14:47:28,012 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269570058] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:28,012 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:28,012 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:47:28,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495031741] [2021-06-05 14:47:28,012 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:47:28,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:28,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:47:28,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:47:28,013 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 14:47:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:28,084 INFO L93 Difference]: Finished difference Result 449 states and 1320 transitions. [2021-06-05 14:47:28,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:28,084 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 14:47:28,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:28,085 INFO L225 Difference]: With dead ends: 449 [2021-06-05 14:47:28,085 INFO L226 Difference]: Without dead ends: 449 [2021-06-05 14:47:28,085 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 49.8ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:28,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-06-05 14:47:28,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 235. [2021-06-05 14:47:28,088 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 14:47:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 707 transitions. [2021-06-05 14:47:28,088 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 707 transitions. Word has length 19 [2021-06-05 14:47:28,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:28,088 INFO L482 AbstractCegarLoop]: Abstraction has 235 states and 707 transitions. [2021-06-05 14:47:28,088 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 14:47:28,088 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 707 transitions. [2021-06-05 14:47:28,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:28,088 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:28,088 INFO L521 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 14:47:28,289 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable626,158 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:28,289 INFO L430 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:28,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:28,289 INFO L82 PathProgramCache]: Analyzing trace with hash 170307403, now seen corresponding path program 44 times [2021-06-05 14:47:28,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:28,289 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128795374] [2021-06-05 14:47:28,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:28,313 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 14:47:28,313 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:28,313 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128795374] [2021-06-05 14:47:28,313 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128795374] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:28,313 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192433718] [2021-06-05 14:47:28,313 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 14:47:28,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:28,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:28,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:28,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:28,373 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 14:47:28,374 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192433718] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:28,374 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:28,374 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:28,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855994416] [2021-06-05 14:47:28,374 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:28,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:28,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:28,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:28,374 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 14:47:28,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:28,454 INFO L93 Difference]: Finished difference Result 437 states and 1251 transitions. [2021-06-05 14:47:28,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:28,455 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 14:47:28,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:28,455 INFO L225 Difference]: With dead ends: 437 [2021-06-05 14:47:28,455 INFO L226 Difference]: Without dead ends: 431 [2021-06-05 14:47:28,455 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 56.7ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:28,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-06-05 14:47:28,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 241. [2021-06-05 14:47:28,458 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 14:47:28,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 721 transitions. [2021-06-05 14:47:28,458 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 721 transitions. Word has length 19 [2021-06-05 14:47:28,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:28,458 INFO L482 AbstractCegarLoop]: Abstraction has 241 states and 721 transitions. [2021-06-05 14:47:28,458 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 14:47:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 721 transitions. [2021-06-05 14:47:28,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:28,459 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:28,459 INFO L521 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 14:47:28,659 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 159 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable627 [2021-06-05 14:47:28,659 INFO L430 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:28,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:28,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1045052217, now seen corresponding path program 45 times [2021-06-05 14:47:28,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:28,660 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888218772] [2021-06-05 14:47:28,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:28,683 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 14:47:28,683 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:28,683 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888218772] [2021-06-05 14:47:28,683 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888218772] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:28,683 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548468515] [2021-06-05 14:47:28,683 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 14:47:28,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:47:28,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:28,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:28,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:28,744 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 14:47:28,744 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548468515] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:28,744 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:28,744 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:28,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916600459] [2021-06-05 14:47:28,744 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:28,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:28,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:28,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:28,744 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 14:47:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:28,823 INFO L93 Difference]: Finished difference Result 415 states and 1214 transitions. [2021-06-05 14:47:28,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:28,824 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 14:47:28,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:28,824 INFO L225 Difference]: With dead ends: 415 [2021-06-05 14:47:28,824 INFO L226 Difference]: Without dead ends: 415 [2021-06-05 14:47:28,824 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 57.1ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:28,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2021-06-05 14:47:28,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 214. [2021-06-05 14:47:28,827 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 14:47:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 639 transitions. [2021-06-05 14:47:28,827 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 639 transitions. Word has length 19 [2021-06-05 14:47:28,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:28,827 INFO L482 AbstractCegarLoop]: Abstraction has 214 states and 639 transitions. [2021-06-05 14:47:28,827 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 14:47:28,827 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 639 transitions. [2021-06-05 14:47:28,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:28,828 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:28,828 INFO L521 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 14:47:29,028 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 160 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable630 [2021-06-05 14:47:29,028 INFO L430 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:29,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:29,028 INFO L82 PathProgramCache]: Analyzing trace with hash -990658535, now seen corresponding path program 46 times [2021-06-05 14:47:29,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:29,028 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606238951] [2021-06-05 14:47:29,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:29,056 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 14:47:29,056 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:29,056 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606238951] [2021-06-05 14:47:29,056 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606238951] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:29,056 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612474539] [2021-06-05 14:47:29,056 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 14:47:29,082 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:47:29,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:29,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:29,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:29,116 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 14:47:29,116 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612474539] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:29,116 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:29,116 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:29,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523601754] [2021-06-05 14:47:29,117 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:29,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:29,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:29,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:29,117 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 14:47:29,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:29,186 INFO L93 Difference]: Finished difference Result 367 states and 1064 transitions. [2021-06-05 14:47:29,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:29,187 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 14:47:29,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:29,187 INFO L225 Difference]: With dead ends: 367 [2021-06-05 14:47:29,187 INFO L226 Difference]: Without dead ends: 355 [2021-06-05 14:47:29,187 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 50.4ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:29,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2021-06-05 14:47:29,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 217. [2021-06-05 14:47:29,190 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 14:47:29,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 648 transitions. [2021-06-05 14:47:29,190 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 648 transitions. Word has length 19 [2021-06-05 14:47:29,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:29,190 INFO L482 AbstractCegarLoop]: Abstraction has 217 states and 648 transitions. [2021-06-05 14:47:29,190 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 14:47:29,190 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 648 transitions. [2021-06-05 14:47:29,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:29,190 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:29,190 INFO L521 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 14:47:29,391 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 161 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable631 [2021-06-05 14:47:29,391 INFO L430 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:29,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:29,391 INFO L82 PathProgramCache]: Analyzing trace with hash -33107299, now seen corresponding path program 47 times [2021-06-05 14:47:29,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:29,391 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103834354] [2021-06-05 14:47:29,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:29,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 14:47:29,414 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:29,414 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103834354] [2021-06-05 14:47:29,414 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103834354] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:29,414 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520238646] [2021-06-05 14:47:29,414 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 14:47:29,438 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:29,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:29,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:29,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:29,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 14:47:29,481 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520238646] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:29,481 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:29,481 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:29,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771538857] [2021-06-05 14:47:29,482 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:29,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:29,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:29,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:29,482 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 14:47:29,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:29,556 INFO L93 Difference]: Finished difference Result 355 states and 1025 transitions. [2021-06-05 14:47:29,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:29,557 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 14:47:29,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:29,557 INFO L225 Difference]: With dead ends: 355 [2021-06-05 14:47:29,557 INFO L226 Difference]: Without dead ends: 349 [2021-06-05 14:47:29,557 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 62.8ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:47:29,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-06-05 14:47:29,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 229. [2021-06-05 14:47:29,560 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 14:47:29,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 687 transitions. [2021-06-05 14:47:29,560 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 687 transitions. Word has length 19 [2021-06-05 14:47:29,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:29,560 INFO L482 AbstractCegarLoop]: Abstraction has 229 states and 687 transitions. [2021-06-05 14:47:29,560 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 14:47:29,560 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 687 transitions. [2021-06-05 14:47:29,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:29,560 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:29,560 INFO L521 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 14:47:29,764 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable634,162 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:29,765 INFO L430 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:29,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:29,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1248466919, now seen corresponding path program 48 times [2021-06-05 14:47:29,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:29,765 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438210996] [2021-06-05 14:47:29,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:29,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 14:47:29,790 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:29,790 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438210996] [2021-06-05 14:47:29,790 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438210996] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:29,790 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017269427] [2021-06-05 14:47:29,790 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 14:47:29,815 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:47:29,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:29,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:29,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:29,861 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 14:47:29,861 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017269427] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:29,861 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:29,861 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:29,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441590121] [2021-06-05 14:47:29,861 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:29,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:29,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:29,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:29,861 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 14:47:29,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:29,938 INFO L93 Difference]: Finished difference Result 320 states and 940 transitions. [2021-06-05 14:47:29,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:29,938 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 14:47:29,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:29,939 INFO L225 Difference]: With dead ends: 320 [2021-06-05 14:47:29,939 INFO L226 Difference]: Without dead ends: 320 [2021-06-05 14:47:29,939 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 67.0ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:47:29,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-06-05 14:47:29,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 215. [2021-06-05 14:47:29,941 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 14:47:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 643 transitions. [2021-06-05 14:47:29,941 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 643 transitions. Word has length 19 [2021-06-05 14:47:29,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:29,942 INFO L482 AbstractCegarLoop]: Abstraction has 215 states and 643 transitions. [2021-06-05 14:47:29,942 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 14:47:29,942 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 643 transitions. [2021-06-05 14:47:29,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:29,942 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:29,942 INFO L521 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 14:47:30,142 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable637,163 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:30,142 INFO L430 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:30,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:30,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1006159271, now seen corresponding path program 49 times [2021-06-05 14:47:30,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:30,143 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692898668] [2021-06-05 14:47:30,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:30,169 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 14:47:30,169 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:30,169 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692898668] [2021-06-05 14:47:30,169 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692898668] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:30,169 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:30,169 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:30,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361241093] [2021-06-05 14:47:30,169 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:30,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:30,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:30,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:30,169 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 14:47:30,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:30,265 INFO L93 Difference]: Finished difference Result 361 states and 1031 transitions. [2021-06-05 14:47:30,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:30,265 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 14:47:30,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:30,266 INFO L225 Difference]: With dead ends: 361 [2021-06-05 14:47:30,266 INFO L226 Difference]: Without dead ends: 353 [2021-06-05 14:47:30,266 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 76.9ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:30,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-06-05 14:47:30,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 233. [2021-06-05 14:47:30,269 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 14:47:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 695 transitions. [2021-06-05 14:47:30,269 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 695 transitions. Word has length 19 [2021-06-05 14:47:30,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:30,269 INFO L482 AbstractCegarLoop]: Abstraction has 233 states and 695 transitions. [2021-06-05 14:47:30,269 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 14:47:30,269 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 695 transitions. [2021-06-05 14:47:30,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:30,269 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:30,269 INFO L521 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 14:47:30,269 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable638 [2021-06-05 14:47:30,269 INFO L430 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:30,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:30,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1386896911, now seen corresponding path program 50 times [2021-06-05 14:47:30,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:30,270 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679696308] [2021-06-05 14:47:30,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:30,297 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 14:47:30,297 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:30,297 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679696308] [2021-06-05 14:47:30,297 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679696308] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:30,297 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:30,297 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:30,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023575769] [2021-06-05 14:47:30,298 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:30,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:30,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:30,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:30,298 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 14:47:30,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:30,401 INFO L93 Difference]: Finished difference Result 359 states and 1026 transitions. [2021-06-05 14:47:30,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:30,401 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 14:47:30,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:30,402 INFO L225 Difference]: With dead ends: 359 [2021-06-05 14:47:30,402 INFO L226 Difference]: Without dead ends: 351 [2021-06-05 14:47:30,402 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 83.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:30,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2021-06-05 14:47:30,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 231. [2021-06-05 14:47:30,404 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 14:47:30,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 688 transitions. [2021-06-05 14:47:30,404 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 688 transitions. Word has length 19 [2021-06-05 14:47:30,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:30,404 INFO L482 AbstractCegarLoop]: Abstraction has 231 states and 688 transitions. [2021-06-05 14:47:30,404 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 14:47:30,404 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 688 transitions. [2021-06-05 14:47:30,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:30,405 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:30,405 INFO L521 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 14:47:30,405 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable639 [2021-06-05 14:47:30,405 INFO L430 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:30,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:30,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1984233569, now seen corresponding path program 51 times [2021-06-05 14:47:30,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:30,405 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443810170] [2021-06-05 14:47:30,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:30,431 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 14:47:30,431 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:30,431 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443810170] [2021-06-05 14:47:30,431 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443810170] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:30,431 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:30,431 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:30,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552881424] [2021-06-05 14:47:30,431 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:30,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:30,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:30,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:30,431 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 14:47:30,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:30,522 INFO L93 Difference]: Finished difference Result 373 states and 1067 transitions. [2021-06-05 14:47:30,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:30,522 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 14:47:30,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:30,522 INFO L225 Difference]: With dead ends: 373 [2021-06-05 14:47:30,522 INFO L226 Difference]: Without dead ends: 359 [2021-06-05 14:47:30,522 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 69.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:30,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-06-05 14:47:30,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 229. [2021-06-05 14:47:30,525 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 14:47:30,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 682 transitions. [2021-06-05 14:47:30,525 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 682 transitions. Word has length 19 [2021-06-05 14:47:30,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:30,525 INFO L482 AbstractCegarLoop]: Abstraction has 229 states and 682 transitions. [2021-06-05 14:47:30,525 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 14:47:30,525 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 682 transitions. [2021-06-05 14:47:30,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:30,526 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:30,526 INFO L521 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 14:47:30,526 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable640 [2021-06-05 14:47:30,526 INFO L430 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:30,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:30,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1454990024, now seen corresponding path program 49 times [2021-06-05 14:47:30,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:30,526 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573420082] [2021-06-05 14:47:30,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:30,557 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 14:47:30,557 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:30,557 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573420082] [2021-06-05 14:47:30,557 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573420082] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:30,557 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862707829] [2021-06-05 14:47:30,557 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 14:47:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:30,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:30,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:30,640 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 14:47:30,640 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862707829] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:30,640 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:30,640 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:30,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416497338] [2021-06-05 14:47:30,640 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:30,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:30,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:30,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:30,641 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 14:47:30,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:30,730 INFO L93 Difference]: Finished difference Result 461 states and 1330 transitions. [2021-06-05 14:47:30,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:30,731 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 14:47:30,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:30,731 INFO L225 Difference]: With dead ends: 461 [2021-06-05 14:47:30,731 INFO L226 Difference]: Without dead ends: 461 [2021-06-05 14:47:30,731 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 84.1ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:47:30,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-06-05 14:47:30,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 235. [2021-06-05 14:47:30,734 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 14:47:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 706 transitions. [2021-06-05 14:47:30,734 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 706 transitions. Word has length 19 [2021-06-05 14:47:30,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:30,734 INFO L482 AbstractCegarLoop]: Abstraction has 235 states and 706 transitions. [2021-06-05 14:47:30,735 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 14:47:30,735 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 706 transitions. [2021-06-05 14:47:30,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:30,735 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:30,735 INFO L521 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 14:47:30,950 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 164 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable641 [2021-06-05 14:47:30,951 INFO L430 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:30,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:30,951 INFO L82 PathProgramCache]: Analyzing trace with hash -524828848, now seen corresponding path program 50 times [2021-06-05 14:47:30,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:30,951 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092245868] [2021-06-05 14:47:30,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:30,978 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 14:47:30,979 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:30,979 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092245868] [2021-06-05 14:47:30,979 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092245868] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:30,979 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372814565] [2021-06-05 14:47:30,979 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 14:47:31,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:31,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:31,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:31,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:31,065 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 14:47:31,066 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372814565] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:31,066 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:31,066 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:31,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716979582] [2021-06-05 14:47:31,066 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:31,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:31,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:31,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:31,066 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 14:47:31,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:31,154 INFO L93 Difference]: Finished difference Result 467 states and 1339 transitions. [2021-06-05 14:47:31,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:31,155 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 14:47:31,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:31,155 INFO L225 Difference]: With dead ends: 467 [2021-06-05 14:47:31,155 INFO L226 Difference]: Without dead ends: 461 [2021-06-05 14:47:31,155 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 75.9ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:47:31,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-06-05 14:47:31,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 232. [2021-06-05 14:47:31,158 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 14:47:31,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 694 transitions. [2021-06-05 14:47:31,158 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 694 transitions. Word has length 19 [2021-06-05 14:47:31,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:31,158 INFO L482 AbstractCegarLoop]: Abstraction has 232 states and 694 transitions. [2021-06-05 14:47:31,158 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 14:47:31,158 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 694 transitions. [2021-06-05 14:47:31,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:31,159 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:31,159 INFO L521 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 14:47:31,374 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 165 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable642 [2021-06-05 14:47:31,374 INFO L430 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:31,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:31,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1537521380, now seen corresponding path program 51 times [2021-06-05 14:47:31,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:31,375 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103882890] [2021-06-05 14:47:31,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:31,402 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 14:47:31,402 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:31,402 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103882890] [2021-06-05 14:47:31,402 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103882890] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:31,402 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181495210] [2021-06-05 14:47:31,402 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 14:47:31,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:47:31,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:31,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:31,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:31,475 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 14:47:31,475 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181495210] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:31,475 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:31,475 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:31,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980772274] [2021-06-05 14:47:31,475 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:31,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:31,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:31,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:31,476 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 14:47:31,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:31,541 INFO L93 Difference]: Finished difference Result 458 states and 1306 transitions. [2021-06-05 14:47:31,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:31,541 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 14:47:31,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:31,542 INFO L225 Difference]: With dead ends: 458 [2021-06-05 14:47:31,542 INFO L226 Difference]: Without dead ends: 446 [2021-06-05 14:47:31,542 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 56.4ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:31,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2021-06-05 14:47:31,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 230. [2021-06-05 14:47:31,544 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 14:47:31,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 686 transitions. [2021-06-05 14:47:31,545 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 686 transitions. Word has length 19 [2021-06-05 14:47:31,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:31,545 INFO L482 AbstractCegarLoop]: Abstraction has 230 states and 686 transitions. [2021-06-05 14:47:31,545 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 14:47:31,545 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 686 transitions. [2021-06-05 14:47:31,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:31,545 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:31,545 INFO L521 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 14:47:31,752 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable645,166 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:31,753 INFO L430 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:31,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:31,753 INFO L82 PathProgramCache]: Analyzing trace with hash 242250915, now seen corresponding path program 52 times [2021-06-05 14:47:31,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:31,753 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574070015] [2021-06-05 14:47:31,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:31,777 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 14:47:31,777 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:31,778 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574070015] [2021-06-05 14:47:31,778 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574070015] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:31,778 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:31,778 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:31,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347417816] [2021-06-05 14:47:31,778 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:31,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:31,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:31,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:31,778 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 14:47:31,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:31,862 INFO L93 Difference]: Finished difference Result 403 states and 1125 transitions. [2021-06-05 14:47:31,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:31,862 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 14:47:31,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:31,862 INFO L225 Difference]: With dead ends: 403 [2021-06-05 14:47:31,862 INFO L226 Difference]: Without dead ends: 395 [2021-06-05 14:47:31,862 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 60.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:31,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-06-05 14:47:31,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 242. [2021-06-05 14:47:31,865 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 14:47:31,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 732 transitions. [2021-06-05 14:47:31,865 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 732 transitions. Word has length 19 [2021-06-05 14:47:31,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:31,865 INFO L482 AbstractCegarLoop]: Abstraction has 242 states and 732 transitions. [2021-06-05 14:47:31,865 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 14:47:31,866 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 732 transitions. [2021-06-05 14:47:31,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:31,866 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:31,866 INFO L521 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 14:47:31,866 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable648 [2021-06-05 14:47:31,866 INFO L430 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:31,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:31,866 INFO L82 PathProgramCache]: Analyzing trace with hash 622988555, now seen corresponding path program 53 times [2021-06-05 14:47:31,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:31,866 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329188835] [2021-06-05 14:47:31,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:31,890 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 14:47:31,890 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:31,890 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329188835] [2021-06-05 14:47:31,890 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329188835] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:31,890 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:31,890 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:31,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882312277] [2021-06-05 14:47:31,890 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:31,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:31,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:31,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:31,891 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 14:47:31,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:31,974 INFO L93 Difference]: Finished difference Result 409 states and 1140 transitions. [2021-06-05 14:47:31,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:31,974 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 14:47:31,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:31,975 INFO L225 Difference]: With dead ends: 409 [2021-06-05 14:47:31,975 INFO L226 Difference]: Without dead ends: 401 [2021-06-05 14:47:31,975 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 60.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:31,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2021-06-05 14:47:31,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 244. [2021-06-05 14:47:31,978 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 14:47:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 736 transitions. [2021-06-05 14:47:31,978 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 736 transitions. Word has length 19 [2021-06-05 14:47:31,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:31,978 INFO L482 AbstractCegarLoop]: Abstraction has 244 states and 736 transitions. [2021-06-05 14:47:31,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 14:47:31,978 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 736 transitions. [2021-06-05 14:47:31,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:31,978 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:31,978 INFO L521 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 14:47:31,978 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable649 [2021-06-05 14:47:31,979 INFO L430 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:31,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:31,979 INFO L82 PathProgramCache]: Analyzing trace with hash -2120353452, now seen corresponding path program 52 times [2021-06-05 14:47:31,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:31,979 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985281544] [2021-06-05 14:47:31,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:32,007 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 14:47:32,007 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:32,007 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985281544] [2021-06-05 14:47:32,007 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985281544] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:32,007 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283955490] [2021-06-05 14:47:32,007 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 14:47:32,031 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:47:32,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:32,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:32,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:32,083 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 14:47:32,084 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283955490] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:32,084 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:32,084 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:32,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873931059] [2021-06-05 14:47:32,084 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:32,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:32,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:32,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:32,084 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 14:47:32,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:32,156 INFO L93 Difference]: Finished difference Result 532 states and 1524 transitions. [2021-06-05 14:47:32,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:32,156 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 14:47:32,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:32,157 INFO L225 Difference]: With dead ends: 532 [2021-06-05 14:47:32,157 INFO L226 Difference]: Without dead ends: 532 [2021-06-05 14:47:32,157 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 67.2ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:32,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-06-05 14:47:32,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 250. [2021-06-05 14:47:32,160 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 14:47:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 763 transitions. [2021-06-05 14:47:32,160 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 763 transitions. Word has length 19 [2021-06-05 14:47:32,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:32,161 INFO L482 AbstractCegarLoop]: Abstraction has 250 states and 763 transitions. [2021-06-05 14:47:32,161 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 14:47:32,161 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 763 transitions. [2021-06-05 14:47:32,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:32,161 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:32,161 INFO L521 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 14:47:32,376 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 167 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable650 [2021-06-05 14:47:32,377 INFO L430 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:32,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:32,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1190192276, now seen corresponding path program 53 times [2021-06-05 14:47:32,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:32,377 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149217726] [2021-06-05 14:47:32,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:32,402 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 14:47:32,403 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:32,403 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149217726] [2021-06-05 14:47:32,403 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149217726] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:32,403 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075890223] [2021-06-05 14:47:32,403 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 14:47:32,433 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:32,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:32,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:32,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:32,483 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 14:47:32,483 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075890223] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:32,483 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:32,483 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:32,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241323502] [2021-06-05 14:47:32,483 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:32,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:32,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:32,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:32,484 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 14:47:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:32,551 INFO L93 Difference]: Finished difference Result 514 states and 1455 transitions. [2021-06-05 14:47:32,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:32,552 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 14:47:32,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:32,552 INFO L225 Difference]: With dead ends: 514 [2021-06-05 14:47:32,552 INFO L226 Difference]: Without dead ends: 508 [2021-06-05 14:47:32,553 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 62.1ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:32,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-06-05 14:47:32,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 249. [2021-06-05 14:47:32,555 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 14:47:32,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 758 transitions. [2021-06-05 14:47:32,556 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 758 transitions. Word has length 19 [2021-06-05 14:47:32,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:32,556 INFO L482 AbstractCegarLoop]: Abstraction has 249 states and 758 transitions. [2021-06-05 14:47:32,556 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 14:47:32,556 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 758 transitions. [2021-06-05 14:47:32,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:32,556 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:32,556 INFO L521 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 14:47:32,759 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 168 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable651 [2021-06-05 14:47:32,760 INFO L430 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:32,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:32,760 INFO L82 PathProgramCache]: Analyzing trace with hash 38116775, now seen corresponding path program 54 times [2021-06-05 14:47:32,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:32,760 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413276933] [2021-06-05 14:47:32,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:32,788 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 14:47:32,788 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:32,788 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413276933] [2021-06-05 14:47:32,788 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413276933] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:32,788 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858851612] [2021-06-05 14:47:32,788 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 14:47:32,813 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:47:32,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:32,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:32,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:32,864 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 14:47:32,864 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858851612] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:32,864 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:32,864 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:32,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654782006] [2021-06-05 14:47:32,865 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:32,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:32,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:32,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:32,865 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 14:47:32,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:32,942 INFO L93 Difference]: Finished difference Result 375 states and 1066 transitions. [2021-06-05 14:47:32,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:32,942 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 14:47:32,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:32,943 INFO L225 Difference]: With dead ends: 375 [2021-06-05 14:47:32,943 INFO L226 Difference]: Without dead ends: 367 [2021-06-05 14:47:32,943 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 65.6ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:32,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-06-05 14:47:32,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 249. [2021-06-05 14:47:32,945 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 14:47:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 761 transitions. [2021-06-05 14:47:32,946 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 761 transitions. Word has length 19 [2021-06-05 14:47:32,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:32,946 INFO L482 AbstractCegarLoop]: Abstraction has 249 states and 761 transitions. [2021-06-05 14:47:32,946 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 14:47:32,946 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 761 transitions. [2021-06-05 14:47:32,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:32,946 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:32,946 INFO L521 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 14:47:33,147 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 169 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable654 [2021-06-05 14:47:33,147 INFO L430 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:33,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:33,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1919953796, now seen corresponding path program 54 times [2021-06-05 14:47:33,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:33,147 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305271656] [2021-06-05 14:47:33,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:33,175 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 14:47:33,175 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:33,175 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305271656] [2021-06-05 14:47:33,176 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305271656] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:33,176 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639724862] [2021-06-05 14:47:33,176 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 14:47:33,200 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:47:33,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:33,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:33,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:33,261 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 14:47:33,261 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639724862] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:33,261 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:33,261 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:33,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387972129] [2021-06-05 14:47:33,261 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:33,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:33,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:33,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:33,262 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 14:47:33,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:33,347 INFO L93 Difference]: Finished difference Result 459 states and 1316 transitions. [2021-06-05 14:47:33,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:33,348 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 14:47:33,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:33,348 INFO L225 Difference]: With dead ends: 459 [2021-06-05 14:47:33,348 INFO L226 Difference]: Without dead ends: 459 [2021-06-05 14:47:33,348 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 68.6ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:33,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-06-05 14:47:33,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 240. [2021-06-05 14:47:33,351 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 14:47:33,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 731 transitions. [2021-06-05 14:47:33,351 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 731 transitions. Word has length 19 [2021-06-05 14:47:33,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:33,351 INFO L482 AbstractCegarLoop]: Abstraction has 240 states and 731 transitions. [2021-06-05 14:47:33,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 14:47:33,351 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 731 transitions. [2021-06-05 14:47:33,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:33,352 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:33,352 INFO L521 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 14:47:33,552 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 170 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable657 [2021-06-05 14:47:33,552 INFO L430 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:33,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:33,553 INFO L82 PathProgramCache]: Analyzing trace with hash -2001194468, now seen corresponding path program 55 times [2021-06-05 14:47:33,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:33,553 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414001299] [2021-06-05 14:47:33,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:33,578 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 14:47:33,578 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:33,578 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414001299] [2021-06-05 14:47:33,578 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414001299] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:33,578 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404815625] [2021-06-05 14:47:33,578 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 14:47:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:33,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:33,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:33,668 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 14:47:33,668 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404815625] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:33,668 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:33,668 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:33,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962598544] [2021-06-05 14:47:33,669 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:33,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:33,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:33,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:33,669 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 14:47:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:33,751 INFO L93 Difference]: Finished difference Result 414 states and 1188 transitions. [2021-06-05 14:47:33,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:33,752 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 14:47:33,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:33,752 INFO L225 Difference]: With dead ends: 414 [2021-06-05 14:47:33,752 INFO L226 Difference]: Without dead ends: 405 [2021-06-05 14:47:33,752 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 63.4ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:33,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2021-06-05 14:47:33,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 240. [2021-06-05 14:47:33,755 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 14:47:33,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 727 transitions. [2021-06-05 14:47:33,769 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 727 transitions. Word has length 19 [2021-06-05 14:47:33,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:33,769 INFO L482 AbstractCegarLoop]: Abstraction has 240 states and 727 transitions. [2021-06-05 14:47:33,769 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 14:47:33,769 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 727 transitions. [2021-06-05 14:47:33,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:33,769 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:33,769 INFO L521 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 14:47:33,969 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 171 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable658 [2021-06-05 14:47:33,970 INFO L430 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:33,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:33,970 INFO L82 PathProgramCache]: Analyzing trace with hash 318111335, now seen corresponding path program 55 times [2021-06-05 14:47:33,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:33,970 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710156829] [2021-06-05 14:47:33,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:33,996 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 14:47:33,997 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:33,997 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710156829] [2021-06-05 14:47:33,997 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710156829] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:33,997 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739614908] [2021-06-05 14:47:33,997 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 14:47:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:34,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:34,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:34,075 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 14:47:34,076 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739614908] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:34,076 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:34,076 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:34,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088988798] [2021-06-05 14:47:34,076 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:34,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:34,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:34,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:34,076 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 14:47:34,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:34,168 INFO L93 Difference]: Finished difference Result 347 states and 1016 transitions. [2021-06-05 14:47:34,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:34,168 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 14:47:34,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:34,169 INFO L225 Difference]: With dead ends: 347 [2021-06-05 14:47:34,169 INFO L226 Difference]: Without dead ends: 347 [2021-06-05 14:47:34,169 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 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 14:47:34,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-06-05 14:47:34,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 236. [2021-06-05 14:47:34,171 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 14:47:34,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 715 transitions. [2021-06-05 14:47:34,171 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 715 transitions. Word has length 19 [2021-06-05 14:47:34,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:34,172 INFO L482 AbstractCegarLoop]: Abstraction has 236 states and 715 transitions. [2021-06-05 14:47:34,172 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 14:47:34,172 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 715 transitions. [2021-06-05 14:47:34,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:34,172 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:34,172 INFO L521 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 14:47:34,372 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable661,172 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:34,372 INFO L430 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:34,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:34,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1377350628, now seen corresponding path program 56 times [2021-06-05 14:47:34,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:34,373 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350710020] [2021-06-05 14:47:34,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:34,401 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 14:47:34,401 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:34,401 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350710020] [2021-06-05 14:47:34,401 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350710020] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:34,401 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:34,401 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:34,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541674005] [2021-06-05 14:47:34,401 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:34,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:34,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:34,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:34,401 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 14:47:34,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:34,462 INFO L93 Difference]: Finished difference Result 452 states and 1270 transitions. [2021-06-05 14:47:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:34,462 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 14:47:34,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:34,462 INFO L225 Difference]: With dead ends: 452 [2021-06-05 14:47:34,462 INFO L226 Difference]: Without dead ends: 446 [2021-06-05 14:47:34,462 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 38.0ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:34,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2021-06-05 14:47:34,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 246. [2021-06-05 14:47:34,465 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 14:47:34,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 740 transitions. [2021-06-05 14:47:34,465 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 740 transitions. Word has length 19 [2021-06-05 14:47:34,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:34,466 INFO L482 AbstractCegarLoop]: Abstraction has 246 states and 740 transitions. [2021-06-05 14:47:34,466 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 14:47:34,466 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 740 transitions. [2021-06-05 14:47:34,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:34,466 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:34,466 INFO L521 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 14:47:34,466 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable662 [2021-06-05 14:47:34,466 INFO L430 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:34,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:34,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1815702516, now seen corresponding path program 57 times [2021-06-05 14:47:34,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:34,466 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175254555] [2021-06-05 14:47:34,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:34,495 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 14:47:34,495 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:34,495 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175254555] [2021-06-05 14:47:34,495 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175254555] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:34,495 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:34,495 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:34,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925172059] [2021-06-05 14:47:34,495 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:34,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:34,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:34,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:34,496 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 14:47:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:34,574 INFO L93 Difference]: Finished difference Result 416 states and 1187 transitions. [2021-06-05 14:47:34,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:34,574 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 14:47:34,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:34,575 INFO L225 Difference]: With dead ends: 416 [2021-06-05 14:47:34,575 INFO L226 Difference]: Without dead ends: 405 [2021-06-05 14:47:34,575 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 39.7ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:34,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2021-06-05 14:47:34,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 236. [2021-06-05 14:47:34,577 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 14:47:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 714 transitions. [2021-06-05 14:47:34,578 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 714 transitions. Word has length 19 [2021-06-05 14:47:34,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:34,578 INFO L482 AbstractCegarLoop]: Abstraction has 236 states and 714 transitions. [2021-06-05 14:47:34,578 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 14:47:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 714 transitions. [2021-06-05 14:47:34,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:34,578 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:34,578 INFO L521 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 14:47:34,578 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable663 [2021-06-05 14:47:34,578 INFO L430 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:34,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:34,579 INFO L82 PathProgramCache]: Analyzing trace with hash -653338417, now seen corresponding path program 56 times [2021-06-05 14:47:34,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:34,579 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119438747] [2021-06-05 14:47:34,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:34,607 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 14:47:34,607 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:34,607 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119438747] [2021-06-05 14:47:34,607 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119438747] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:34,607 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:34,607 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:34,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498061172] [2021-06-05 14:47:34,608 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:34,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:34,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:34,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:34,608 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 14:47:34,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:34,701 INFO L93 Difference]: Finished difference Result 388 states and 1108 transitions. [2021-06-05 14:47:34,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:34,701 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 14:47:34,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:34,701 INFO L225 Difference]: With dead ends: 388 [2021-06-05 14:47:34,701 INFO L226 Difference]: Without dead ends: 382 [2021-06-05 14:47:34,701 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 62.6ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-06-05 14:47:34,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 248. [2021-06-05 14:47:34,704 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 14:47:34,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 751 transitions. [2021-06-05 14:47:34,704 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 751 transitions. Word has length 19 [2021-06-05 14:47:34,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:34,704 INFO L482 AbstractCegarLoop]: Abstraction has 248 states and 751 transitions. [2021-06-05 14:47:34,704 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 14:47:34,704 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 751 transitions. [2021-06-05 14:47:34,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:34,705 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:34,705 INFO L521 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 14:47:34,705 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable664 [2021-06-05 14:47:34,705 INFO L430 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:34,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:34,705 INFO L82 PathProgramCache]: Analyzing trace with hash -382828725, now seen corresponding path program 57 times [2021-06-05 14:47:34,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:34,705 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797083480] [2021-06-05 14:47:34,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:34,731 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 14:47:34,732 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:34,732 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797083480] [2021-06-05 14:47:34,732 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797083480] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:34,732 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:34,732 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:34,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992223278] [2021-06-05 14:47:34,732 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:34,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:34,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:34,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:34,732 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 14:47:34,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:34,829 INFO L93 Difference]: Finished difference Result 366 states and 1071 transitions. [2021-06-05 14:47:34,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:34,829 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 14:47:34,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:34,829 INFO L225 Difference]: With dead ends: 366 [2021-06-05 14:47:34,829 INFO L226 Difference]: Without dead ends: 366 [2021-06-05 14:47:34,830 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 62.8ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:34,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-06-05 14:47:34,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 235. [2021-06-05 14:47:34,832 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 14:47:34,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 711 transitions. [2021-06-05 14:47:34,832 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 711 transitions. Word has length 19 [2021-06-05 14:47:34,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:34,832 INFO L482 AbstractCegarLoop]: Abstraction has 235 states and 711 transitions. [2021-06-05 14:47:34,832 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 14:47:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 711 transitions. [2021-06-05 14:47:34,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:34,833 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:34,833 INFO L521 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 14:47:34,833 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable665 [2021-06-05 14:47:34,833 INFO L430 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:34,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:34,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1250504300, now seen corresponding path program 58 times [2021-06-05 14:47:34,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:34,833 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343903722] [2021-06-05 14:47:34,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:34,854 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 14:47:34,855 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:34,855 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343903722] [2021-06-05 14:47:34,855 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343903722] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:34,855 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:34,855 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:34,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206524629] [2021-06-05 14:47:34,855 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:34,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:34,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:34,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:34,855 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 14:47:34,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:34,909 INFO L93 Difference]: Finished difference Result 391 states and 1119 transitions. [2021-06-05 14:47:34,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:34,909 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 14:47:34,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:34,910 INFO L225 Difference]: With dead ends: 391 [2021-06-05 14:47:34,910 INFO L226 Difference]: Without dead ends: 379 [2021-06-05 14:47:34,910 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 33.8ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:34,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-06-05 14:47:34,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 237. [2021-06-05 14:47:34,912 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 14:47:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 714 transitions. [2021-06-05 14:47:34,912 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 714 transitions. Word has length 19 [2021-06-05 14:47:34,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:34,913 INFO L482 AbstractCegarLoop]: Abstraction has 237 states and 714 transitions. [2021-06-05 14:47:34,913 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 14:47:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 714 transitions. [2021-06-05 14:47:34,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:34,913 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:34,913 INFO L521 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 14:47:34,913 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable666 [2021-06-05 14:47:34,913 INFO L430 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:34,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:34,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1644682960, now seen corresponding path program 59 times [2021-06-05 14:47:34,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:34,913 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418369771] [2021-06-05 14:47:34,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:34,937 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 14:47:34,937 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:34,937 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418369771] [2021-06-05 14:47:34,937 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418369771] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:34,937 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:34,937 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:34,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137291421] [2021-06-05 14:47:34,937 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:34,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:34,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:34,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:34,937 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 14:47:34,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:34,999 INFO L93 Difference]: Finished difference Result 379 states and 1081 transitions. [2021-06-05 14:47:34,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:34,999 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 14:47:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:35,000 INFO L225 Difference]: With dead ends: 379 [2021-06-05 14:47:35,000 INFO L226 Difference]: Without dead ends: 373 [2021-06-05 14:47:35,000 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 42.1ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:35,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-06-05 14:47:35,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 247. [2021-06-05 14:47:35,002 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 14:47:35,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 739 transitions. [2021-06-05 14:47:35,003 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 739 transitions. Word has length 19 [2021-06-05 14:47:35,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:35,003 INFO L482 AbstractCegarLoop]: Abstraction has 247 states and 739 transitions. [2021-06-05 14:47:35,003 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 14:47:35,003 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 739 transitions. [2021-06-05 14:47:35,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:35,003 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:35,003 INFO L521 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 14:47:35,003 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable667 [2021-06-05 14:47:35,003 INFO L430 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:35,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:35,004 INFO L82 PathProgramCache]: Analyzing trace with hash 542768808, now seen corresponding path program 60 times [2021-06-05 14:47:35,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:35,004 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289382537] [2021-06-05 14:47:35,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:35,027 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 14:47:35,027 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:35,027 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289382537] [2021-06-05 14:47:35,027 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289382537] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:35,027 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:35,027 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:35,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858225022] [2021-06-05 14:47:35,028 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:35,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:35,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:35,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:35,028 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 14:47:35,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:35,077 INFO L93 Difference]: Finished difference Result 343 states and 998 transitions. [2021-06-05 14:47:35,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:35,077 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 14:47:35,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:35,078 INFO L225 Difference]: With dead ends: 343 [2021-06-05 14:47:35,078 INFO L226 Difference]: Without dead ends: 330 [2021-06-05 14:47:35,078 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 39.5ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:35,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-06-05 14:47:35,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 235. [2021-06-05 14:47:35,080 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 14:47:35,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 710 transitions. [2021-06-05 14:47:35,080 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 710 transitions. Word has length 19 [2021-06-05 14:47:35,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:35,080 INFO L482 AbstractCegarLoop]: Abstraction has 235 states and 710 transitions. [2021-06-05 14:47:35,081 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 14:47:35,081 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 710 transitions. [2021-06-05 14:47:35,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:35,081 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:35,081 INFO L521 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 14:47:35,081 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable668 [2021-06-05 14:47:35,081 INFO L430 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:35,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:35,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1072803101, now seen corresponding path program 58 times [2021-06-05 14:47:35,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:35,081 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785155315] [2021-06-05 14:47:35,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:35,103 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 14:47:35,104 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:35,104 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785155315] [2021-06-05 14:47:35,104 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785155315] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:35,104 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:35,104 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:35,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098744259] [2021-06-05 14:47:35,104 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:35,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:35,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:35,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:35,104 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 14:47:35,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:35,186 INFO L93 Difference]: Finished difference Result 325 states and 939 transitions. [2021-06-05 14:47:35,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:35,186 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 14:47:35,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:35,186 INFO L225 Difference]: With dead ends: 325 [2021-06-05 14:47:35,186 INFO L226 Difference]: Without dead ends: 313 [2021-06-05 14:47:35,187 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 60.3ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:35,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-06-05 14:47:35,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 235. [2021-06-05 14:47:35,189 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 14:47:35,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 709 transitions. [2021-06-05 14:47:35,189 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 709 transitions. Word has length 19 [2021-06-05 14:47:35,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:35,189 INFO L482 AbstractCegarLoop]: Abstraction has 235 states and 709 transitions. [2021-06-05 14:47:35,189 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 14:47:35,189 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 709 transitions. [2021-06-05 14:47:35,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:35,190 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:35,190 INFO L521 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 14:47:35,190 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable669 [2021-06-05 14:47:35,190 INFO L430 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:35,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:35,190 INFO L82 PathProgramCache]: Analyzing trace with hash -2138427743, now seen corresponding path program 59 times [2021-06-05 14:47:35,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:35,190 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859781503] [2021-06-05 14:47:35,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:35,215 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 14:47:35,215 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:35,215 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859781503] [2021-06-05 14:47:35,215 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859781503] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:35,215 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:35,215 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:35,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987632585] [2021-06-05 14:47:35,215 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:35,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:35,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:35,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:35,215 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 14:47:35,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:35,302 INFO L93 Difference]: Finished difference Result 329 states and 951 transitions. [2021-06-05 14:47:35,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:35,303 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 14:47:35,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:35,303 INFO L225 Difference]: With dead ends: 329 [2021-06-05 14:47:35,303 INFO L226 Difference]: Without dead ends: 323 [2021-06-05 14:47:35,303 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 61.6ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:35,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-06-05 14:47:35,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 241. [2021-06-05 14:47:35,305 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 14:47:35,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 723 transitions. [2021-06-05 14:47:35,306 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 723 transitions. Word has length 19 [2021-06-05 14:47:35,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:35,306 INFO L482 AbstractCegarLoop]: Abstraction has 241 states and 723 transitions. [2021-06-05 14:47:35,306 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 14:47:35,306 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 723 transitions. [2021-06-05 14:47:35,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:35,306 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:35,306 INFO L521 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 14:47:35,306 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable670 [2021-06-05 14:47:35,306 INFO L430 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:35,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:35,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1867918051, now seen corresponding path program 60 times [2021-06-05 14:47:35,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:35,307 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087263998] [2021-06-05 14:47:35,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:35,334 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 14:47:35,334 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:35,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087263998] [2021-06-05 14:47:35,334 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087263998] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:35,334 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:35,334 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:35,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385212368] [2021-06-05 14:47:35,334 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:35,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:35,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:35,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:35,335 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 14:47:35,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:35,426 INFO L93 Difference]: Finished difference Result 294 states and 876 transitions. [2021-06-05 14:47:35,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:35,426 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 14:47:35,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:35,427 INFO L225 Difference]: With dead ends: 294 [2021-06-05 14:47:35,427 INFO L226 Difference]: Without dead ends: 294 [2021-06-05 14:47:35,427 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 64.4ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:35,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-06-05 14:47:35,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 217. [2021-06-05 14:47:35,429 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 14:47:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 650 transitions. [2021-06-05 14:47:35,429 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 650 transitions. Word has length 19 [2021-06-05 14:47:35,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:35,429 INFO L482 AbstractCegarLoop]: Abstraction has 217 states and 650 transitions. [2021-06-05 14:47:35,429 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 14:47:35,429 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 650 transitions. [2021-06-05 14:47:35,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:35,430 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:35,430 INFO L521 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 14:47:35,430 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable671 [2021-06-05 14:47:35,430 INFO L430 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:35,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:35,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1028896921, now seen corresponding path program 61 times [2021-06-05 14:47:35,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:35,430 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268514921] [2021-06-05 14:47:35,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:35,452 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 14:47:35,452 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:35,452 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268514921] [2021-06-05 14:47:35,452 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268514921] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:35,452 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:35,452 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:35,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795490514] [2021-06-05 14:47:35,452 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:35,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:35,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:35,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:35,453 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 14:47:35,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:35,508 INFO L93 Difference]: Finished difference Result 362 states and 1019 transitions. [2021-06-05 14:47:35,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:35,508 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 14:47:35,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:35,508 INFO L225 Difference]: With dead ends: 362 [2021-06-05 14:47:35,508 INFO L226 Difference]: Without dead ends: 346 [2021-06-05 14:47:35,509 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 41.4ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:35,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-06-05 14:47:35,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 219. [2021-06-05 14:47:35,511 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 14:47:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 653 transitions. [2021-06-05 14:47:35,511 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 653 transitions. Word has length 19 [2021-06-05 14:47:35,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:35,511 INFO L482 AbstractCegarLoop]: Abstraction has 219 states and 653 transitions. [2021-06-05 14:47:35,511 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 14:47:35,511 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 653 transitions. [2021-06-05 14:47:35,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:35,511 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:35,512 INFO L521 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 14:47:35,512 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable672 [2021-06-05 14:47:35,512 INFO L430 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:35,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:35,512 INFO L82 PathProgramCache]: Analyzing trace with hash 493077425, now seen corresponding path program 62 times [2021-06-05 14:47:35,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:35,512 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142825643] [2021-06-05 14:47:35,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:35,535 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 14:47:35,535 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:35,536 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142825643] [2021-06-05 14:47:35,536 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142825643] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:35,536 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:35,536 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:35,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363117623] [2021-06-05 14:47:35,536 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:35,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:35,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:35,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:35,536 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 14:47:35,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:35,609 INFO L93 Difference]: Finished difference Result 391 states and 1075 transitions. [2021-06-05 14:47:35,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:35,609 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 14:47:35,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:35,610 INFO L225 Difference]: With dead ends: 391 [2021-06-05 14:47:35,610 INFO L226 Difference]: Without dead ends: 383 [2021-06-05 14:47:35,610 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 54.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:35,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-06-05 14:47:35,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 231. [2021-06-05 14:47:35,613 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 14:47:35,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 683 transitions. [2021-06-05 14:47:35,613 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 683 transitions. Word has length 19 [2021-06-05 14:47:35,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:35,613 INFO L482 AbstractCegarLoop]: Abstraction has 231 states and 683 transitions. [2021-06-05 14:47:35,613 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 14:47:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 683 transitions. [2021-06-05 14:47:35,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:35,613 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:35,614 INFO L521 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 14:47:35,614 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable673 [2021-06-05 14:47:35,614 INFO L430 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:35,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:35,614 INFO L82 PathProgramCache]: Analyzing trace with hash 873815065, now seen corresponding path program 63 times [2021-06-05 14:47:35,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:35,614 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554582917] [2021-06-05 14:47:35,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:35,637 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 14:47:35,637 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:35,637 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554582917] [2021-06-05 14:47:35,637 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554582917] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:35,637 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:35,637 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:35,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741492712] [2021-06-05 14:47:35,638 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:35,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:35,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:35,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:35,638 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 14:47:35,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:35,704 INFO L93 Difference]: Finished difference Result 354 states and 997 transitions. [2021-06-05 14:47:35,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:35,704 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 14:47:35,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:35,705 INFO L225 Difference]: With dead ends: 354 [2021-06-05 14:47:35,705 INFO L226 Difference]: Without dead ends: 344 [2021-06-05 14:47:35,705 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 50.9ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:35,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-06-05 14:47:35,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 217. [2021-06-05 14:47:35,707 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 14:47:35,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 648 transitions. [2021-06-05 14:47:35,708 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 648 transitions. Word has length 19 [2021-06-05 14:47:35,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:35,708 INFO L482 AbstractCegarLoop]: Abstraction has 217 states and 648 transitions. [2021-06-05 14:47:35,708 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 14:47:35,708 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 648 transitions. [2021-06-05 14:47:35,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:35,708 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:35,708 INFO L521 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 14:47:35,708 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable674 [2021-06-05 14:47:35,708 INFO L430 AbstractCegarLoop]: === Iteration 336 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:35,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:35,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1196865479, now seen corresponding path program 64 times [2021-06-05 14:47:35,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:35,708 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792219560] [2021-06-05 14:47:35,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:35,731 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 14:47:35,732 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:35,732 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792219560] [2021-06-05 14:47:35,732 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792219560] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:35,732 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:35,732 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:35,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768709247] [2021-06-05 14:47:35,732 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:35,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:35,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:35,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:35,732 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 14:47:35,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:35,801 INFO L93 Difference]: Finished difference Result 397 states and 1090 transitions. [2021-06-05 14:47:35,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:35,801 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 14:47:35,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:35,801 INFO L225 Difference]: With dead ends: 397 [2021-06-05 14:47:35,801 INFO L226 Difference]: Without dead ends: 389 [2021-06-05 14:47:35,801 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 50.7ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:35,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-06-05 14:47:35,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 233. [2021-06-05 14:47:35,804 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 14:47:35,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 690 transitions. [2021-06-05 14:47:35,804 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 690 transitions. Word has length 19 [2021-06-05 14:47:35,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:35,804 INFO L482 AbstractCegarLoop]: Abstraction has 233 states and 690 transitions. [2021-06-05 14:47:35,804 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 14:47:35,805 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 690 transitions. [2021-06-05 14:47:35,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:35,805 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:35,805 INFO L521 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 14:47:35,805 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable675 [2021-06-05 14:47:35,805 INFO L430 AbstractCegarLoop]: === Iteration 337 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:35,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:35,805 INFO L82 PathProgramCache]: Analyzing trace with hash -816127839, now seen corresponding path program 65 times [2021-06-05 14:47:35,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:35,805 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072983016] [2021-06-05 14:47:35,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:35,828 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 14:47:35,828 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:35,828 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072983016] [2021-06-05 14:47:35,828 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072983016] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:35,829 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:35,829 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:35,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655759758] [2021-06-05 14:47:35,829 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:35,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:35,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:35,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:35,829 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 14:47:35,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:35,900 INFO L93 Difference]: Finished difference Result 395 states and 1085 transitions. [2021-06-05 14:47:35,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:35,901 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 14:47:35,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:35,901 INFO L225 Difference]: With dead ends: 395 [2021-06-05 14:47:35,901 INFO L226 Difference]: Without dead ends: 387 [2021-06-05 14:47:35,901 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 53.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:35,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-06-05 14:47:35,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 231. [2021-06-05 14:47:35,904 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 14:47:35,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 683 transitions. [2021-06-05 14:47:35,904 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 683 transitions. Word has length 19 [2021-06-05 14:47:35,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:35,904 INFO L482 AbstractCegarLoop]: Abstraction has 231 states and 683 transitions. [2021-06-05 14:47:35,904 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 14:47:35,904 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 683 transitions. [2021-06-05 14:47:35,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:35,905 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:35,905 INFO L521 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 14:47:35,905 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable676 [2021-06-05 14:47:35,905 INFO L430 AbstractCegarLoop]: === Iteration 338 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:35,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:35,905 INFO L82 PathProgramCache]: Analyzing trace with hash -218791181, now seen corresponding path program 66 times [2021-06-05 14:47:35,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:35,905 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402997752] [2021-06-05 14:47:35,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:35,927 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 14:47:35,927 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:35,927 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402997752] [2021-06-05 14:47:35,927 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402997752] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:35,927 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:35,927 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:35,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051220857] [2021-06-05 14:47:35,927 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:35,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:35,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:35,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:35,928 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 14:47:35,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:35,984 INFO L93 Difference]: Finished difference Result 358 states and 1005 transitions. [2021-06-05 14:47:35,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:35,984 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 14:47:35,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:35,985 INFO L225 Difference]: With dead ends: 358 [2021-06-05 14:47:35,985 INFO L226 Difference]: Without dead ends: 342 [2021-06-05 14:47:35,985 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 44.6ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:35,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-06-05 14:47:35,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 215. [2021-06-05 14:47:35,987 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 14:47:35,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 644 transitions. [2021-06-05 14:47:35,987 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 644 transitions. Word has length 19 [2021-06-05 14:47:35,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:35,987 INFO L482 AbstractCegarLoop]: Abstraction has 215 states and 644 transitions. [2021-06-05 14:47:35,987 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 14:47:35,987 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 644 transitions. [2021-06-05 14:47:35,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:35,988 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:35,988 INFO L521 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 14:47:35,988 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable677 [2021-06-05 14:47:35,988 INFO L430 AbstractCegarLoop]: === Iteration 339 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:35,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:35,988 INFO L82 PathProgramCache]: Analyzing trace with hash 313632770, now seen corresponding path program 61 times [2021-06-05 14:47:35,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:35,988 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190069875] [2021-06-05 14:47:35,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:36,013 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 14:47:36,013 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:36,013 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190069875] [2021-06-05 14:47:36,013 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190069875] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:36,013 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673885291] [2021-06-05 14:47:36,013 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 14:47:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:36,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:36,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:36,069 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 14:47:36,070 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673885291] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:36,070 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:36,070 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:47:36,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339663520] [2021-06-05 14:47:36,070 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:47:36,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:36,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:47:36,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:47:36,070 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 14:47:36,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:36,144 INFO L93 Difference]: Finished difference Result 390 states and 1140 transitions. [2021-06-05 14:47:36,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:36,144 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 14:47:36,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:36,145 INFO L225 Difference]: With dead ends: 390 [2021-06-05 14:47:36,145 INFO L226 Difference]: Without dead ends: 390 [2021-06-05 14:47:36,145 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 51.8ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:36,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-06-05 14:47:36,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 218. [2021-06-05 14:47:36,147 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 14:47:36,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 653 transitions. [2021-06-05 14:47:36,147 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 653 transitions. Word has length 19 [2021-06-05 14:47:36,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:36,148 INFO L482 AbstractCegarLoop]: Abstraction has 218 states and 653 transitions. [2021-06-05 14:47:36,148 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 14:47:36,148 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 653 transitions. [2021-06-05 14:47:36,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:36,148 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:36,148 INFO L521 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 14:47:36,348 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 173 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable678 [2021-06-05 14:47:36,348 INFO L430 AbstractCegarLoop]: === Iteration 340 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:36,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:36,349 INFO L82 PathProgramCache]: Analyzing trace with hash 157800938, now seen corresponding path program 62 times [2021-06-05 14:47:36,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:36,349 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364624443] [2021-06-05 14:47:36,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:36,374 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 14:47:36,374 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:36,374 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364624443] [2021-06-05 14:47:36,374 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364624443] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:36,374 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731662051] [2021-06-05 14:47:36,374 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 14:47:36,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:36,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:36,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:36,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:36,437 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 14:47:36,437 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731662051] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:36,437 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:36,437 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:36,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664786384] [2021-06-05 14:47:36,437 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:36,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:36,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:36,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:36,438 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 14:47:36,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:36,514 INFO L93 Difference]: Finished difference Result 453 states and 1308 transitions. [2021-06-05 14:47:36,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:36,515 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 14:47:36,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:36,515 INFO L225 Difference]: With dead ends: 453 [2021-06-05 14:47:36,515 INFO L226 Difference]: Without dead ends: 453 [2021-06-05 14:47:36,515 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 58.4ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:36,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-06-05 14:47:36,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 221. [2021-06-05 14:47:36,518 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 14:47:36,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 665 transitions. [2021-06-05 14:47:36,518 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 665 transitions. Word has length 19 [2021-06-05 14:47:36,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:36,518 INFO L482 AbstractCegarLoop]: Abstraction has 221 states and 665 transitions. [2021-06-05 14:47:36,518 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 14:47:36,518 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 665 transitions. [2021-06-05 14:47:36,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:36,519 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:36,519 INFO L521 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 14:47:36,719 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable679,174 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:36,719 INFO L430 AbstractCegarLoop]: === Iteration 341 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:36,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:36,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1087962114, now seen corresponding path program 63 times [2021-06-05 14:47:36,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:36,719 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025426788] [2021-06-05 14:47:36,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:36,744 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 14:47:36,744 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:36,744 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025426788] [2021-06-05 14:47:36,745 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025426788] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:36,745 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230858859] [2021-06-05 14:47:36,745 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 14:47:36,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:47:36,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:36,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:36,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:36,810 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 14:47:36,811 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230858859] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:36,811 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:36,811 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:36,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439343593] [2021-06-05 14:47:36,811 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:36,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:36,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:36,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:36,811 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 14:47:36,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:36,887 INFO L93 Difference]: Finished difference Result 399 states and 1161 transitions. [2021-06-05 14:47:36,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:36,887 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 14:47:36,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:36,888 INFO L225 Difference]: With dead ends: 399 [2021-06-05 14:47:36,888 INFO L226 Difference]: Without dead ends: 393 [2021-06-05 14:47:36,888 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 56.1ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:36,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2021-06-05 14:47:36,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 215. [2021-06-05 14:47:36,890 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 14:47:36,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 644 transitions. [2021-06-05 14:47:36,891 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 644 transitions. Word has length 19 [2021-06-05 14:47:36,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:36,891 INFO L482 AbstractCegarLoop]: Abstraction has 215 states and 644 transitions. [2021-06-05 14:47:36,891 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 14:47:36,891 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 644 transitions. [2021-06-05 14:47:36,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:36,891 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:36,891 INFO L521 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 14:47:37,091 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable680,175 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:37,092 INFO L430 AbstractCegarLoop]: === Iteration 342 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:37,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:37,092 INFO L82 PathProgramCache]: Analyzing trace with hash -727997342, now seen corresponding path program 64 times [2021-06-05 14:47:37,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:37,092 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272382439] [2021-06-05 14:47:37,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:37,131 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 14:47:37,132 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:37,132 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272382439] [2021-06-05 14:47:37,132 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272382439] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:37,132 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779844065] [2021-06-05 14:47:37,132 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 14:47:37,157 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:47:37,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:37,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:37,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:37,201 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 14:47:37,201 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779844065] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:37,202 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:37,202 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:37,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475764239] [2021-06-05 14:47:37,202 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:37,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:37,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:37,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:37,202 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 14:47:37,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:37,280 INFO L93 Difference]: Finished difference Result 423 states and 1218 transitions. [2021-06-05 14:47:37,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:37,280 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 14:47:37,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:37,280 INFO L225 Difference]: With dead ends: 423 [2021-06-05 14:47:37,281 INFO L226 Difference]: Without dead ends: 423 [2021-06-05 14:47:37,281 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 72.9ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:47:37,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-06-05 14:47:37,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 221. [2021-06-05 14:47:37,283 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 14:47:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 668 transitions. [2021-06-05 14:47:37,283 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 668 transitions. Word has length 19 [2021-06-05 14:47:37,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:37,284 INFO L482 AbstractCegarLoop]: Abstraction has 221 states and 668 transitions. [2021-06-05 14:47:37,284 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 14:47:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 668 transitions. [2021-06-05 14:47:37,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:37,284 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:37,284 INFO L521 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 14:47:37,484 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 176 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable683 [2021-06-05 14:47:37,484 INFO L430 AbstractCegarLoop]: === Iteration 343 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:37,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:37,485 INFO L82 PathProgramCache]: Analyzing trace with hash 202163834, now seen corresponding path program 65 times [2021-06-05 14:47:37,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:37,485 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821189092] [2021-06-05 14:47:37,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:37,507 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 14:47:37,507 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:37,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821189092] [2021-06-05 14:47:37,508 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821189092] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:37,508 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411028258] [2021-06-05 14:47:37,508 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 14:47:37,535 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:37,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:37,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:37,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:37,579 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 14:47:37,579 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411028258] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:37,579 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:37,579 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:37,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324156767] [2021-06-05 14:47:37,579 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:37,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:37,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:37,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:37,579 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 14:47:37,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:37,654 INFO L93 Difference]: Finished difference Result 429 states and 1227 transitions. [2021-06-05 14:47:37,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:37,654 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 14:47:37,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:37,655 INFO L225 Difference]: With dead ends: 429 [2021-06-05 14:47:37,655 INFO L226 Difference]: Without dead ends: 423 [2021-06-05 14:47:37,655 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 62.8ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:47:37,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-06-05 14:47:37,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 218. [2021-06-05 14:47:37,657 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 14:47:37,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 656 transitions. [2021-06-05 14:47:37,658 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 656 transitions. Word has length 19 [2021-06-05 14:47:37,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:37,658 INFO L482 AbstractCegarLoop]: Abstraction has 218 states and 656 transitions. [2021-06-05 14:47:37,658 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 14:47:37,658 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 656 transitions. [2021-06-05 14:47:37,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:37,658 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:37,658 INFO L521 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 14:47:37,858 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 177 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable684 [2021-06-05 14:47:37,859 INFO L430 AbstractCegarLoop]: === Iteration 344 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:37,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:37,859 INFO L82 PathProgramCache]: Analyzing trace with hash -810528698, now seen corresponding path program 66 times [2021-06-05 14:47:37,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:37,859 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109222371] [2021-06-05 14:47:37,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:37,885 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 14:47:37,886 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:37,886 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109222371] [2021-06-05 14:47:37,886 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109222371] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:37,886 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110738857] [2021-06-05 14:47:37,886 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 14:47:37,910 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:47:37,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:37,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:37,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:37,967 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 14:47:37,967 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110738857] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:37,967 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:37,967 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:37,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799781926] [2021-06-05 14:47:37,967 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:37,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:37,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:37,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:37,968 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 14:47:38,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:38,037 INFO L93 Difference]: Finished difference Result 378 states and 1095 transitions. [2021-06-05 14:47:38,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:38,037 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 14:47:38,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:38,038 INFO L225 Difference]: With dead ends: 378 [2021-06-05 14:47:38,038 INFO L226 Difference]: Without dead ends: 366 [2021-06-05 14:47:38,038 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 60.0ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:38,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-06-05 14:47:38,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 215. [2021-06-05 14:47:38,040 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 14:47:38,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 644 transitions. [2021-06-05 14:47:38,040 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 644 transitions. Word has length 19 [2021-06-05 14:47:38,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:38,040 INFO L482 AbstractCegarLoop]: Abstraction has 215 states and 644 transitions. [2021-06-05 14:47:38,041 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 14:47:38,041 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 644 transitions. [2021-06-05 14:47:38,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:38,041 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:38,041 INFO L521 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 14:47:38,260 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 178 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable687 [2021-06-05 14:47:38,261 INFO L430 AbstractCegarLoop]: === Iteration 345 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:38,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:38,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1177425635, now seen corresponding path program 67 times [2021-06-05 14:47:38,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:38,261 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440880056] [2021-06-05 14:47:38,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:38,284 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 14:47:38,284 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:38,284 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440880056] [2021-06-05 14:47:38,284 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440880056] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:38,284 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:38,284 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:38,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237889890] [2021-06-05 14:47:38,284 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:38,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:38,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:38,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:38,285 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 14:47:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:38,341 INFO L93 Difference]: Finished difference Result 416 states and 1156 transitions. [2021-06-05 14:47:38,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:38,342 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 14:47:38,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:38,342 INFO L225 Difference]: With dead ends: 416 [2021-06-05 14:47:38,342 INFO L226 Difference]: Without dead ends: 400 [2021-06-05 14:47:38,342 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 33.8ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:38,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-06-05 14:47:38,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 219. [2021-06-05 14:47:38,345 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 14:47:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 652 transitions. [2021-06-05 14:47:38,345 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 652 transitions. Word has length 19 [2021-06-05 14:47:38,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:38,345 INFO L482 AbstractCegarLoop]: Abstraction has 219 states and 652 transitions. [2021-06-05 14:47:38,345 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 14:47:38,345 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 652 transitions. [2021-06-05 14:47:38,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:38,345 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:38,345 INFO L521 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 14:47:38,345 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable690 [2021-06-05 14:47:38,345 INFO L430 AbstractCegarLoop]: === Iteration 346 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:38,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:38,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1713245131, now seen corresponding path program 68 times [2021-06-05 14:47:38,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:38,346 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836817394] [2021-06-05 14:47:38,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:38,368 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 14:47:38,368 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:38,368 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836817394] [2021-06-05 14:47:38,368 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836817394] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:38,368 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:38,368 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:38,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994189785] [2021-06-05 14:47:38,368 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:38,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:38,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:38,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:38,369 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 14:47:38,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:38,438 INFO L93 Difference]: Finished difference Result 445 states and 1210 transitions. [2021-06-05 14:47:38,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:38,439 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 14:47:38,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:38,439 INFO L225 Difference]: With dead ends: 445 [2021-06-05 14:47:38,439 INFO L226 Difference]: Without dead ends: 437 [2021-06-05 14:47:38,439 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 42.5ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:38,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-06-05 14:47:38,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 235. [2021-06-05 14:47:38,442 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 14:47:38,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 696 transitions. [2021-06-05 14:47:38,443 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 696 transitions. Word has length 19 [2021-06-05 14:47:38,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:38,443 INFO L482 AbstractCegarLoop]: Abstraction has 235 states and 696 transitions. [2021-06-05 14:47:38,443 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 14:47:38,443 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 696 transitions. [2021-06-05 14:47:38,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:38,443 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:38,443 INFO L521 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 14:47:38,443 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable691 [2021-06-05 14:47:38,443 INFO L430 AbstractCegarLoop]: === Iteration 347 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:38,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:38,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1332507491, now seen corresponding path program 69 times [2021-06-05 14:47:38,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:38,443 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305558662] [2021-06-05 14:47:38,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:38,466 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 14:47:38,467 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:38,467 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305558662] [2021-06-05 14:47:38,467 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305558662] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:38,467 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:38,467 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:38,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352001432] [2021-06-05 14:47:38,467 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:38,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:38,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:38,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:38,467 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 14:47:38,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:38,527 INFO L93 Difference]: Finished difference Result 408 states and 1124 transitions. [2021-06-05 14:47:38,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:38,527 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 14:47:38,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:38,527 INFO L225 Difference]: With dead ends: 408 [2021-06-05 14:47:38,527 INFO L226 Difference]: Without dead ends: 398 [2021-06-05 14:47:38,528 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 39.2ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:38,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-06-05 14:47:38,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 225. [2021-06-05 14:47:38,530 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 14:47:38,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 668 transitions. [2021-06-05 14:47:38,530 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 668 transitions. Word has length 19 [2021-06-05 14:47:38,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:38,530 INFO L482 AbstractCegarLoop]: Abstraction has 225 states and 668 transitions. [2021-06-05 14:47:38,531 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 14:47:38,531 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 668 transitions. [2021-06-05 14:47:38,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:38,531 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:38,531 INFO L521 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 14:47:38,531 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable692 [2021-06-05 14:47:38,531 INFO L430 AbstractCegarLoop]: === Iteration 348 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:38,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:38,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1162202982, now seen corresponding path program 67 times [2021-06-05 14:47:38,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:38,531 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304003364] [2021-06-05 14:47:38,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:38,554 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 14:47:38,555 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:38,555 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304003364] [2021-06-05 14:47:38,555 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304003364] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:38,555 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747632975] [2021-06-05 14:47:38,555 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 14:47:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:38,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:38,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:38,610 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 14:47:38,610 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747632975] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:38,610 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:38,610 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:47:38,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792830851] [2021-06-05 14:47:38,611 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:47:38,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:38,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:47:38,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:47:38,611 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 14:47:38,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:38,688 INFO L93 Difference]: Finished difference Result 510 states and 1495 transitions. [2021-06-05 14:47:38,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:38,688 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 14:47:38,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:38,688 INFO L225 Difference]: With dead ends: 510 [2021-06-05 14:47:38,689 INFO L226 Difference]: Without dead ends: 510 [2021-06-05 14:47:38,689 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 46.3ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:38,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2021-06-05 14:47:38,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 225. [2021-06-05 14:47:38,691 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 14:47:38,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 668 transitions. [2021-06-05 14:47:38,692 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 668 transitions. Word has length 19 [2021-06-05 14:47:38,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:38,692 INFO L482 AbstractCegarLoop]: Abstraction has 225 states and 668 transitions. [2021-06-05 14:47:38,692 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 14:47:38,692 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 668 transitions. [2021-06-05 14:47:38,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:38,692 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:38,692 INFO L521 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 14:47:38,892 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable693,179 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:38,893 INFO L430 AbstractCegarLoop]: === Iteration 349 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:38,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:38,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1006371150, now seen corresponding path program 68 times [2021-06-05 14:47:38,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:38,893 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135926659] [2021-06-05 14:47:38,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:38,918 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 14:47:38,918 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:38,918 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135926659] [2021-06-05 14:47:38,918 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135926659] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:38,918 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996358863] [2021-06-05 14:47:38,918 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 14:47:38,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:38,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:38,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:38,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:38,986 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 14:47:38,986 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996358863] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:38,986 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:38,986 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:38,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170610152] [2021-06-05 14:47:38,986 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:38,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:38,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:38,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:38,986 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 14:47:39,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:39,069 INFO L93 Difference]: Finished difference Result 528 states and 1528 transitions. [2021-06-05 14:47:39,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:39,069 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 14:47:39,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:39,070 INFO L225 Difference]: With dead ends: 528 [2021-06-05 14:47:39,070 INFO L226 Difference]: Without dead ends: 528 [2021-06-05 14:47:39,070 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 57.2ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:39,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-06-05 14:47:39,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 231. [2021-06-05 14:47:39,073 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 14:47:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 695 transitions. [2021-06-05 14:47:39,073 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 695 transitions. Word has length 19 [2021-06-05 14:47:39,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:39,073 INFO L482 AbstractCegarLoop]: Abstraction has 231 states and 695 transitions. [2021-06-05 14:47:39,073 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 14:47:39,073 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 695 transitions. [2021-06-05 14:47:39,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:39,073 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:39,073 INFO L521 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 14:47:39,289 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable694,180 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:39,289 INFO L430 AbstractCegarLoop]: === Iteration 350 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:39,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:39,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1936532326, now seen corresponding path program 69 times [2021-06-05 14:47:39,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:39,289 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376186003] [2021-06-05 14:47:39,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:39,311 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 14:47:39,311 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:39,311 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376186003] [2021-06-05 14:47:39,311 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376186003] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:39,311 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393918031] [2021-06-05 14:47:39,311 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 14:47:39,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:47:39,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:39,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:39,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:39,375 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 14:47:39,375 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393918031] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:39,375 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:39,376 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:39,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777711986] [2021-06-05 14:47:39,376 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:39,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:39,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:39,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:39,376 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 14:47:39,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:39,444 INFO L93 Difference]: Finished difference Result 474 states and 1375 transitions. [2021-06-05 14:47:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:39,444 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 14:47:39,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:39,445 INFO L225 Difference]: With dead ends: 474 [2021-06-05 14:47:39,445 INFO L226 Difference]: Without dead ends: 468 [2021-06-05 14:47:39,445 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 48.5ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:39,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-06-05 14:47:39,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 227. [2021-06-05 14:47:39,447 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 14:47:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 681 transitions. [2021-06-05 14:47:39,448 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 681 transitions. Word has length 19 [2021-06-05 14:47:39,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:39,448 INFO L482 AbstractCegarLoop]: Abstraction has 227 states and 681 transitions. [2021-06-05 14:47:39,448 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 14:47:39,448 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 681 transitions. [2021-06-05 14:47:39,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:39,448 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:39,448 INFO L521 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 14:47:39,648 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 181 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable695 [2021-06-05 14:47:39,649 INFO L430 AbstractCegarLoop]: === Iteration 351 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:39,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:39,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1084350617, now seen corresponding path program 70 times [2021-06-05 14:47:39,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:39,649 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990593190] [2021-06-05 14:47:39,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:39,671 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 14:47:39,671 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:39,671 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990593190] [2021-06-05 14:47:39,672 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990593190] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:39,672 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536066962] [2021-06-05 14:47:39,672 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 14:47:39,696 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:47:39,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:39,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:39,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:39,739 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 14:47:39,739 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536066962] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:39,740 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:39,740 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:39,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763090238] [2021-06-05 14:47:39,740 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:39,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:39,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:39,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:39,740 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 14:47:39,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:39,799 INFO L93 Difference]: Finished difference Result 367 states and 1041 transitions. [2021-06-05 14:47:39,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:39,799 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 14:47:39,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:39,799 INFO L225 Difference]: With dead ends: 367 [2021-06-05 14:47:39,800 INFO L226 Difference]: Without dead ends: 351 [2021-06-05 14:47:39,800 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 54.0ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:39,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2021-06-05 14:47:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 221. [2021-06-05 14:47:39,802 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 14:47:39,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 660 transitions. [2021-06-05 14:47:39,802 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 660 transitions. Word has length 19 [2021-06-05 14:47:39,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:39,802 INFO L482 AbstractCegarLoop]: Abstraction has 221 states and 660 transitions. [2021-06-05 14:47:39,802 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 14:47:39,802 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 660 transitions. [2021-06-05 14:47:39,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:39,803 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:39,803 INFO L521 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 14:47:40,003 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable698,182 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:40,003 INFO L430 AbstractCegarLoop]: === Iteration 352 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:40,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:40,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1215342274, now seen corresponding path program 70 times [2021-06-05 14:47:40,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:40,004 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847473217] [2021-06-05 14:47:40,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:40,027 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 14:47:40,027 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:40,027 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847473217] [2021-06-05 14:47:40,027 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847473217] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:40,027 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817209438] [2021-06-05 14:47:40,027 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 14:47:40,052 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:47:40,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:40,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:40,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:40,089 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 14:47:40,090 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817209438] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:40,090 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:40,090 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:47:40,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355468407] [2021-06-05 14:47:40,090 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:47:40,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:40,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:47:40,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:47:40,090 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 14:47:40,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:40,161 INFO L93 Difference]: Finished difference Result 404 states and 1187 transitions. [2021-06-05 14:47:40,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:40,161 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 14:47:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:40,161 INFO L225 Difference]: With dead ends: 404 [2021-06-05 14:47:40,162 INFO L226 Difference]: Without dead ends: 404 [2021-06-05 14:47:40,162 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 48.5ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:40,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-06-05 14:47:40,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 200. [2021-06-05 14:47:40,164 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 14:47:40,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 594 transitions. [2021-06-05 14:47:40,164 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 594 transitions. Word has length 19 [2021-06-05 14:47:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:40,164 INFO L482 AbstractCegarLoop]: Abstraction has 200 states and 594 transitions. [2021-06-05 14:47:40,164 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 14:47:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 594 transitions. [2021-06-05 14:47:40,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:40,165 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:40,165 INFO L521 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 14:47:40,365 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 183 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable701 [2021-06-05 14:47:40,365 INFO L430 AbstractCegarLoop]: === Iteration 353 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:40,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:40,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1597715687, now seen corresponding path program 71 times [2021-06-05 14:47:40,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:40,365 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304488304] [2021-06-05 14:47:40,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:40,390 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 14:47:40,391 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:40,391 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304488304] [2021-06-05 14:47:40,391 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304488304] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:40,391 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646713989] [2021-06-05 14:47:40,391 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 14:47:40,415 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:40,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:40,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:40,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:40,464 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 14:47:40,464 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646713989] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:40,464 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:40,464 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:40,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917579507] [2021-06-05 14:47:40,464 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:40,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:40,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:40,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:40,465 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 14:47:40,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:40,549 INFO L93 Difference]: Finished difference Result 356 states and 1020 transitions. [2021-06-05 14:47:40,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:40,549 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 14:47:40,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:40,550 INFO L225 Difference]: With dead ends: 356 [2021-06-05 14:47:40,550 INFO L226 Difference]: Without dead ends: 348 [2021-06-05 14:47:40,550 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 65.8ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:47:40,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-06-05 14:47:40,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 216. [2021-06-05 14:47:40,552 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 14:47:40,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 650 transitions. [2021-06-05 14:47:40,552 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 650 transitions. Word has length 19 [2021-06-05 14:47:40,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:40,552 INFO L482 AbstractCegarLoop]: Abstraction has 216 states and 650 transitions. [2021-06-05 14:47:40,552 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 14:47:40,553 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 650 transitions. [2021-06-05 14:47:40,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:40,553 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:40,553 INFO L521 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 14:47:40,753 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable702,184 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:40,753 INFO L430 AbstractCegarLoop]: === Iteration 354 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:40,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:40,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1565768734, now seen corresponding path program 71 times [2021-06-05 14:47:40,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:40,754 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357677681] [2021-06-05 14:47:40,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:40,778 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 14:47:40,778 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:40,778 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357677681] [2021-06-05 14:47:40,778 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357677681] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:40,778 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748917777] [2021-06-05 14:47:40,778 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 14:47:40,802 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:40,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:40,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:40,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:40,844 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 14:47:40,844 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748917777] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:40,844 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:40,844 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:40,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036610422] [2021-06-05 14:47:40,844 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:40,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:40,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:40,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:40,845 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 14:47:40,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:40,933 INFO L93 Difference]: Finished difference Result 393 states and 1145 transitions. [2021-06-05 14:47:40,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:40,934 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 14:47:40,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:40,934 INFO L225 Difference]: With dead ends: 393 [2021-06-05 14:47:40,934 INFO L226 Difference]: Without dead ends: 393 [2021-06-05 14:47:40,934 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 58.0ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:40,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2021-06-05 14:47:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 216. [2021-06-05 14:47:40,937 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 14:47:40,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 650 transitions. [2021-06-05 14:47:40,937 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 650 transitions. Word has length 19 [2021-06-05 14:47:40,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:40,937 INFO L482 AbstractCegarLoop]: Abstraction has 216 states and 650 transitions. [2021-06-05 14:47:40,937 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 14:47:40,937 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 650 transitions. [2021-06-05 14:47:40,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:40,937 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:40,937 INFO L521 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 14:47:41,144 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 185 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable705 [2021-06-05 14:47:41,145 INFO L430 AbstractCegarLoop]: === Iteration 355 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:41,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:41,145 INFO L82 PathProgramCache]: Analyzing trace with hash 857230482, now seen corresponding path program 72 times [2021-06-05 14:47:41,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:41,145 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242919696] [2021-06-05 14:47:41,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:41,167 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 14:47:41,167 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:41,167 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242919696] [2021-06-05 14:47:41,167 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242919696] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:41,167 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813823559] [2021-06-05 14:47:41,167 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 14:47:41,191 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:47:41,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:41,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:41,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:41,228 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 14:47:41,228 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813823559] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:41,228 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:41,228 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:47:41,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011410455] [2021-06-05 14:47:41,228 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:47:41,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:41,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:47:41,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:47:41,229 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 14:47:41,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:41,294 INFO L93 Difference]: Finished difference Result 339 states and 995 transitions. [2021-06-05 14:47:41,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:41,294 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 14:47:41,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:41,294 INFO L225 Difference]: With dead ends: 339 [2021-06-05 14:47:41,294 INFO L226 Difference]: Without dead ends: 330 [2021-06-05 14:47:41,295 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 49.8ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:41,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-06-05 14:47:41,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 216. [2021-06-05 14:47:41,297 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 14:47:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 646 transitions. [2021-06-05 14:47:41,297 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 646 transitions. Word has length 19 [2021-06-05 14:47:41,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:41,297 INFO L482 AbstractCegarLoop]: Abstraction has 216 states and 646 transitions. [2021-06-05 14:47:41,297 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 14:47:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 646 transitions. [2021-06-05 14:47:41,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:41,297 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:41,298 INFO L521 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 14:47:41,498 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable706,186 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:41,498 INFO L430 AbstractCegarLoop]: === Iteration 356 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:41,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:41,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1118431011, now seen corresponding path program 72 times [2021-06-05 14:47:41,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:41,498 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238168372] [2021-06-05 14:47:41,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:41,526 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 14:47:41,526 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:41,526 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238168372] [2021-06-05 14:47:41,526 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238168372] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:41,526 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434783235] [2021-06-05 14:47:41,526 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 14:47:41,551 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:47:41,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:41,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:41,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:41,601 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 14:47:41,602 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434783235] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:41,602 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:41,602 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:41,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580506875] [2021-06-05 14:47:41,602 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:41,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:41,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:41,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:41,602 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 14:47:41,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:41,693 INFO L93 Difference]: Finished difference Result 310 states and 907 transitions. [2021-06-05 14:47:41,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:41,694 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 14:47:41,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:41,694 INFO L225 Difference]: With dead ends: 310 [2021-06-05 14:47:41,694 INFO L226 Difference]: Without dead ends: 310 [2021-06-05 14:47:41,694 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 72.2ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:47:41,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-06-05 14:47:41,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 196. [2021-06-05 14:47:41,696 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 14:47:41,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 582 transitions. [2021-06-05 14:47:41,697 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 582 transitions. Word has length 19 [2021-06-05 14:47:41,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:41,697 INFO L482 AbstractCegarLoop]: Abstraction has 196 states and 582 transitions. [2021-06-05 14:47:41,697 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 14:47:41,697 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 582 transitions. [2021-06-05 14:47:41,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:41,697 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:41,697 INFO L521 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 14:47:41,897 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable709,187 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:41,898 INFO L430 AbstractCegarLoop]: === Iteration 357 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:41,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:41,898 INFO L82 PathProgramCache]: Analyzing trace with hash -720751567, now seen corresponding path program 73 times [2021-06-05 14:47:41,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:41,898 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74955845] [2021-06-05 14:47:41,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:41,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 14:47:41,923 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:41,923 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74955845] [2021-06-05 14:47:41,923 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74955845] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:41,923 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:41,923 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:41,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956285603] [2021-06-05 14:47:41,923 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:41,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:41,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:41,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:41,924 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 14:47:41,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:41,992 INFO L93 Difference]: Finished difference Result 415 states and 1176 transitions. [2021-06-05 14:47:41,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:41,992 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 14:47:41,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:41,993 INFO L225 Difference]: With dead ends: 415 [2021-06-05 14:47:41,993 INFO L226 Difference]: Without dead ends: 407 [2021-06-05 14:47:41,993 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 37.9ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:41,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-06-05 14:47:41,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 216. [2021-06-05 14:47:41,995 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 14:47:41,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 648 transitions. [2021-06-05 14:47:41,995 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 648 transitions. Word has length 19 [2021-06-05 14:47:41,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:41,995 INFO L482 AbstractCegarLoop]: Abstraction has 216 states and 648 transitions. [2021-06-05 14:47:41,995 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 14:47:41,995 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 648 transitions. [2021-06-05 14:47:41,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:41,996 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:41,996 INFO L521 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 14:47:41,996 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable710 [2021-06-05 14:47:41,996 INFO L430 AbstractCegarLoop]: === Iteration 358 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:41,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:41,996 INFO L82 PathProgramCache]: Analyzing trace with hash -340013927, now seen corresponding path program 74 times [2021-06-05 14:47:41,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:41,996 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553260833] [2021-06-05 14:47:41,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:42,020 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 14:47:42,020 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:42,020 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553260833] [2021-06-05 14:47:42,020 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553260833] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:42,020 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:42,020 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:42,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602094745] [2021-06-05 14:47:42,020 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:42,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:42,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:42,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:42,021 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 14:47:42,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:42,089 INFO L93 Difference]: Finished difference Result 421 states and 1191 transitions. [2021-06-05 14:47:42,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:42,089 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 14:47:42,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:42,090 INFO L225 Difference]: With dead ends: 421 [2021-06-05 14:47:42,090 INFO L226 Difference]: Without dead ends: 413 [2021-06-05 14:47:42,090 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 37.6ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-06-05 14:47:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 220. [2021-06-05 14:47:42,092 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 14:47:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 657 transitions. [2021-06-05 14:47:42,092 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 657 transitions. Word has length 19 [2021-06-05 14:47:42,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:42,092 INFO L482 AbstractCegarLoop]: Abstraction has 220 states and 657 transitions. [2021-06-05 14:47:42,092 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 14:47:42,093 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 657 transitions. [2021-06-05 14:47:42,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:42,093 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:42,093 INFO L521 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 14:47:42,093 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable711 [2021-06-05 14:47:42,093 INFO L430 AbstractCegarLoop]: === Iteration 359 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:42,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:42,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1211611362, now seen corresponding path program 73 times [2021-06-05 14:47:42,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:42,093 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949307277] [2021-06-05 14:47:42,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:42,122 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 14:47:42,122 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:42,122 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949307277] [2021-06-05 14:47:42,122 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949307277] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:42,122 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886557709] [2021-06-05 14:47:42,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 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 14:47:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:42,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:42,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:42,191 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 14:47:42,191 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886557709] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:42,191 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:42,191 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:42,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905259257] [2021-06-05 14:47:42,192 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:42,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:42,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:42,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:42,192 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 14:47:42,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:42,282 INFO L93 Difference]: Finished difference Result 479 states and 1393 transitions. [2021-06-05 14:47:42,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:42,283 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 14:47:42,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:42,283 INFO L225 Difference]: With dead ends: 479 [2021-06-05 14:47:42,283 INFO L226 Difference]: Without dead ends: 479 [2021-06-05 14:47:42,283 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 59.8ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:42,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-06-05 14:47:42,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 226. [2021-06-05 14:47:42,286 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 14:47:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 684 transitions. [2021-06-05 14:47:42,286 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 684 transitions. Word has length 19 [2021-06-05 14:47:42,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:42,287 INFO L482 AbstractCegarLoop]: Abstraction has 226 states and 684 transitions. [2021-06-05 14:47:42,287 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 14:47:42,287 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 684 transitions. [2021-06-05 14:47:42,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:42,287 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:42,287 INFO L521 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 14:47:42,487 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 188 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable712 [2021-06-05 14:47:42,487 INFO L430 AbstractCegarLoop]: === Iteration 360 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:42,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:42,488 INFO L82 PathProgramCache]: Analyzing trace with hash 2141772538, now seen corresponding path program 74 times [2021-06-05 14:47:42,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:42,488 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498281704] [2021-06-05 14:47:42,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:42,515 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 14:47:42,515 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:42,515 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498281704] [2021-06-05 14:47:42,515 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498281704] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:42,515 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199803073] [2021-06-05 14:47:42,515 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 14:47:42,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:42,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:42,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:42,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:42,587 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 14:47:42,587 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199803073] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:42,587 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:42,587 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:42,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593624719] [2021-06-05 14:47:42,587 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:42,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:42,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:42,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:42,587 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 14:47:42,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:42,659 INFO L93 Difference]: Finished difference Result 461 states and 1324 transitions. [2021-06-05 14:47:42,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:42,659 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 14:47:42,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:42,660 INFO L225 Difference]: With dead ends: 461 [2021-06-05 14:47:42,660 INFO L226 Difference]: Without dead ends: 455 [2021-06-05 14:47:42,660 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 55.2ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:42,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2021-06-05 14:47:42,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 225. [2021-06-05 14:47:42,663 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 14:47:42,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 679 transitions. [2021-06-05 14:47:42,663 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 679 transitions. Word has length 19 [2021-06-05 14:47:42,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:42,663 INFO L482 AbstractCegarLoop]: Abstraction has 225 states and 679 transitions. [2021-06-05 14:47:42,663 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 14:47:42,663 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 679 transitions. [2021-06-05 14:47:42,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:42,664 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:42,664 INFO L521 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 14:47:42,864 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable713,189 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:42,864 INFO L430 AbstractCegarLoop]: === Iteration 361 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:42,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:42,864 INFO L82 PathProgramCache]: Analyzing trace with hash -924885707, now seen corresponding path program 75 times [2021-06-05 14:47:42,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:42,865 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944389804] [2021-06-05 14:47:42,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:42,890 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 14:47:42,890 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:42,890 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944389804] [2021-06-05 14:47:42,890 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944389804] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:42,890 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477216124] [2021-06-05 14:47:42,890 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 14:47:42,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:47:42,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:42,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:42,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:42,974 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 14:47:42,974 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477216124] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:42,974 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:42,974 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:42,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463030218] [2021-06-05 14:47:42,974 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:42,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:42,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:42,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:42,975 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 14:47:43,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:43,051 INFO L93 Difference]: Finished difference Result 439 states and 1238 transitions. [2021-06-05 14:47:43,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:43,051 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 14:47:43,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:43,052 INFO L225 Difference]: With dead ends: 439 [2021-06-05 14:47:43,052 INFO L226 Difference]: Without dead ends: 431 [2021-06-05 14:47:43,052 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 61.8ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:43,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-06-05 14:47:43,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 225. [2021-06-05 14:47:43,055 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 14:47:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 682 transitions. [2021-06-05 14:47:43,055 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 682 transitions. Word has length 19 [2021-06-05 14:47:43,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:43,055 INFO L482 AbstractCegarLoop]: Abstraction has 225 states and 682 transitions. [2021-06-05 14:47:43,055 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 14:47:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 682 transitions. [2021-06-05 14:47:43,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:43,055 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:43,056 INFO L521 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 14:47:43,271 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 190 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable716 [2021-06-05 14:47:43,271 INFO L430 AbstractCegarLoop]: === Iteration 362 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:43,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:43,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1412011018, now seen corresponding path program 75 times [2021-06-05 14:47:43,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:43,272 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486048975] [2021-06-05 14:47:43,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:43,298 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 14:47:43,298 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:43,298 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486048975] [2021-06-05 14:47:43,298 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486048975] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:43,298 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693593792] [2021-06-05 14:47:43,298 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 14:47:43,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:47:43,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:43,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:43,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:43,368 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 14:47:43,368 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693593792] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:43,368 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:43,368 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:43,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653738244] [2021-06-05 14:47:43,368 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:43,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:43,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:43,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:43,368 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 14:47:43,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:43,453 INFO L93 Difference]: Finished difference Result 458 states and 1317 transitions. [2021-06-05 14:47:43,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:43,454 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 14:47:43,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:43,454 INFO L225 Difference]: With dead ends: 458 [2021-06-05 14:47:43,454 INFO L226 Difference]: Without dead ends: 458 [2021-06-05 14:47:43,454 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 58.4ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:43,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-06-05 14:47:43,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 216. [2021-06-05 14:47:43,457 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 14:47:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 652 transitions. [2021-06-05 14:47:43,457 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 652 transitions. Word has length 19 [2021-06-05 14:47:43,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:43,458 INFO L482 AbstractCegarLoop]: Abstraction has 216 states and 652 transitions. [2021-06-05 14:47:43,458 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 14:47:43,458 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 652 transitions. [2021-06-05 14:47:43,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:43,458 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:43,458 INFO L521 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 14:47:43,658 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable719,191 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:43,658 INFO L430 AbstractCegarLoop]: === Iteration 363 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:43,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:43,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1330770346, now seen corresponding path program 76 times [2021-06-05 14:47:43,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:43,659 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401372814] [2021-06-05 14:47:43,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:43,689 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 14:47:43,689 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:43,689 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401372814] [2021-06-05 14:47:43,689 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401372814] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:43,689 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723678418] [2021-06-05 14:47:43,689 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 14:47:43,716 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:47:43,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:43,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:43,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:43,763 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 14:47:43,763 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723678418] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:43,763 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:43,763 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:43,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994066939] [2021-06-05 14:47:43,763 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:43,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:43,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:43,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:43,763 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 14:47:43,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:43,847 INFO L93 Difference]: Finished difference Result 413 states and 1189 transitions. [2021-06-05 14:47:43,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:43,848 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 14:47:43,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:43,848 INFO L225 Difference]: With dead ends: 413 [2021-06-05 14:47:43,848 INFO L226 Difference]: Without dead ends: 404 [2021-06-05 14:47:43,848 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 59.7ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:47:43,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-06-05 14:47:43,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 216. [2021-06-05 14:47:43,851 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 14:47:43,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 648 transitions. [2021-06-05 14:47:43,851 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 648 transitions. Word has length 19 [2021-06-05 14:47:43,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:43,851 INFO L482 AbstractCegarLoop]: Abstraction has 216 states and 648 transitions. [2021-06-05 14:47:43,851 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 14:47:43,851 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 648 transitions. [2021-06-05 14:47:43,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:43,852 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:43,852 INFO L521 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 14:47:44,052 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable720,192 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:44,052 INFO L430 AbstractCegarLoop]: === Iteration 364 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:44,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:44,052 INFO L82 PathProgramCache]: Analyzing trace with hash -644891147, now seen corresponding path program 76 times [2021-06-05 14:47:44,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:44,052 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963036800] [2021-06-05 14:47:44,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:44,081 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 14:47:44,081 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:44,081 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963036800] [2021-06-05 14:47:44,081 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963036800] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:44,081 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431498082] [2021-06-05 14:47:44,081 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 14:47:44,105 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:47:44,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:44,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:44,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:44,156 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 14:47:44,157 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431498082] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:44,157 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:44,157 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:44,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434926108] [2021-06-05 14:47:44,157 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:44,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:44,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:44,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:44,157 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 14:47:44,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:44,246 INFO L93 Difference]: Finished difference Result 411 states and 1188 transitions. [2021-06-05 14:47:44,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:44,246 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 14:47:44,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:44,247 INFO L225 Difference]: With dead ends: 411 [2021-06-05 14:47:44,247 INFO L226 Difference]: Without dead ends: 411 [2021-06-05 14:47:44,247 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 67.2ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:44,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2021-06-05 14:47:44,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 212. [2021-06-05 14:47:44,249 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 14:47:44,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 636 transitions. [2021-06-05 14:47:44,250 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 636 transitions. Word has length 19 [2021-06-05 14:47:44,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:44,250 INFO L482 AbstractCegarLoop]: Abstraction has 212 states and 636 transitions. [2021-06-05 14:47:44,250 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 14:47:44,250 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 636 transitions. [2021-06-05 14:47:44,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:44,250 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:44,250 INFO L521 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 14:47:44,450 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 193 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable723 [2021-06-05 14:47:44,451 INFO L430 AbstractCegarLoop]: === Iteration 365 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:44,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:44,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1954614186, now seen corresponding path program 77 times [2021-06-05 14:47:44,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:44,451 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677485763] [2021-06-05 14:47:44,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:44,473 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 14:47:44,473 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:44,473 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677485763] [2021-06-05 14:47:44,473 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677485763] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:44,473 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:44,473 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:44,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308362515] [2021-06-05 14:47:44,474 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:44,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:44,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:44,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:44,474 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 14:47:44,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:44,545 INFO L93 Difference]: Finished difference Result 384 states and 1100 transitions. [2021-06-05 14:47:44,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:44,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 14:47:44,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:44,546 INFO L225 Difference]: With dead ends: 384 [2021-06-05 14:47:44,546 INFO L226 Difference]: Without dead ends: 378 [2021-06-05 14:47:44,546 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 39.2ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:44,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-06-05 14:47:44,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 222. [2021-06-05 14:47:44,548 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 14:47:44,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 661 transitions. [2021-06-05 14:47:44,549 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 661 transitions. Word has length 19 [2021-06-05 14:47:44,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:44,549 INFO L482 AbstractCegarLoop]: Abstraction has 222 states and 661 transitions. [2021-06-05 14:47:44,549 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 14:47:44,549 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 661 transitions. [2021-06-05 14:47:44,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:44,549 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:44,549 INFO L521 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 14:47:44,549 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable724 [2021-06-05 14:47:44,549 INFO L430 AbstractCegarLoop]: === Iteration 366 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:44,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:44,549 INFO L82 PathProgramCache]: Analyzing trace with hash 852700034, now seen corresponding path program 78 times [2021-06-05 14:47:44,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:44,550 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912034401] [2021-06-05 14:47:44,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:44,572 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 14:47:44,572 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:44,572 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912034401] [2021-06-05 14:47:44,572 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912034401] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:44,572 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:44,572 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:44,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892981427] [2021-06-05 14:47:44,572 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:44,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:44,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:44,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:44,572 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 14:47:44,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:44,633 INFO L93 Difference]: Finished difference Result 348 states and 1017 transitions. [2021-06-05 14:47:44,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:44,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 14:47:44,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:44,634 INFO L225 Difference]: With dead ends: 348 [2021-06-05 14:47:44,634 INFO L226 Difference]: Without dead ends: 337 [2021-06-05 14:47:44,634 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 39.0ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:44,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-06-05 14:47:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 212. [2021-06-05 14:47:44,636 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 14:47:44,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 635 transitions. [2021-06-05 14:47:44,636 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 635 transitions. Word has length 19 [2021-06-05 14:47:44,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:44,636 INFO L482 AbstractCegarLoop]: Abstraction has 212 states and 635 transitions. [2021-06-05 14:47:44,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 14:47:44,636 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 635 transitions. [2021-06-05 14:47:44,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:44,637 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:44,637 INFO L521 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 14:47:44,637 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable725 [2021-06-05 14:47:44,637 INFO L430 AbstractCegarLoop]: === Iteration 367 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:44,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:44,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1616340899, now seen corresponding path program 77 times [2021-06-05 14:47:44,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:44,637 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453592113] [2021-06-05 14:47:44,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:44,662 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 14:47:44,662 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:44,663 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453592113] [2021-06-05 14:47:44,663 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453592113] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:44,663 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:44,663 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:44,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786449660] [2021-06-05 14:47:44,663 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:44,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:44,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:44,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:44,663 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 14:47:44,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:44,737 INFO L93 Difference]: Finished difference Result 362 states and 1032 transitions. [2021-06-05 14:47:44,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:44,737 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 14:47:44,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:44,738 INFO L225 Difference]: With dead ends: 362 [2021-06-05 14:47:44,738 INFO L226 Difference]: Without dead ends: 356 [2021-06-05 14:47:44,738 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 39.0ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:44,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-06-05 14:47:44,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 218. [2021-06-05 14:47:44,740 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 14:47:44,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 649 transitions. [2021-06-05 14:47:44,741 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 649 transitions. Word has length 19 [2021-06-05 14:47:44,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:44,741 INFO L482 AbstractCegarLoop]: Abstraction has 218 states and 649 transitions. [2021-06-05 14:47:44,741 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 14:47:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 649 transitions. [2021-06-05 14:47:44,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:44,741 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:44,741 INFO L521 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 14:47:44,741 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable726 [2021-06-05 14:47:44,741 INFO L430 AbstractCegarLoop]: === Iteration 368 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:44,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:44,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1345831207, now seen corresponding path program 78 times [2021-06-05 14:47:44,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:44,741 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322374894] [2021-06-05 14:47:44,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:44,769 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 14:47:44,770 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:44,770 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322374894] [2021-06-05 14:47:44,770 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322374894] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:44,770 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:44,770 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:44,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132006911] [2021-06-05 14:47:44,770 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:44,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:44,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:44,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:44,770 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 14:47:44,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:44,846 INFO L93 Difference]: Finished difference Result 340 states and 995 transitions. [2021-06-05 14:47:44,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:44,846 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 14:47:44,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:44,847 INFO L225 Difference]: With dead ends: 340 [2021-06-05 14:47:44,847 INFO L226 Difference]: Without dead ends: 340 [2021-06-05 14:47:44,847 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 42.4ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:44,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-06-05 14:47:44,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 195. [2021-06-05 14:47:44,849 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 14:47:44,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 579 transitions. [2021-06-05 14:47:44,849 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 579 transitions. Word has length 19 [2021-06-05 14:47:44,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:44,849 INFO L482 AbstractCegarLoop]: Abstraction has 195 states and 579 transitions. [2021-06-05 14:47:44,849 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 14:47:44,849 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 579 transitions. [2021-06-05 14:47:44,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:44,849 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:44,850 INFO L521 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 14:47:44,850 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable727 [2021-06-05 14:47:44,850 INFO L430 AbstractCegarLoop]: === Iteration 369 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:44,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:44,850 INFO L82 PathProgramCache]: Analyzing trace with hash -494336067, now seen corresponding path program 79 times [2021-06-05 14:47:44,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:44,850 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790856626] [2021-06-05 14:47:44,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:44,877 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 14:47:44,877 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:44,877 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790856626] [2021-06-05 14:47:44,878 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790856626] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:44,878 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:44,878 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:44,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814717427] [2021-06-05 14:47:44,878 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:44,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:44,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:44,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:44,878 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 14:47:44,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:44,938 INFO L93 Difference]: Finished difference Result 335 states and 937 transitions. [2021-06-05 14:47:44,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:44,946 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 14:47:44,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:44,947 INFO L225 Difference]: With dead ends: 335 [2021-06-05 14:47:44,947 INFO L226 Difference]: Without dead ends: 327 [2021-06-05 14:47:44,947 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 40.8ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:44,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-06-05 14:47:44,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 212. [2021-06-05 14:47:44,949 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 14:47:44,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 626 transitions. [2021-06-05 14:47:44,949 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 626 transitions. Word has length 19 [2021-06-05 14:47:44,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:44,950 INFO L482 AbstractCegarLoop]: Abstraction has 212 states and 626 transitions. [2021-06-05 14:47:44,950 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 14:47:44,950 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 626 transitions. [2021-06-05 14:47:44,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:44,950 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:44,950 INFO L521 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 14:47:44,950 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable728 [2021-06-05 14:47:44,950 INFO L430 AbstractCegarLoop]: === Iteration 370 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:44,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:44,950 INFO L82 PathProgramCache]: Analyzing trace with hash -113598427, now seen corresponding path program 80 times [2021-06-05 14:47:44,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:44,950 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130006012] [2021-06-05 14:47:44,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:44,975 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 14:47:44,976 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:44,976 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130006012] [2021-06-05 14:47:44,976 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130006012] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:44,976 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:44,976 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:44,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973710624] [2021-06-05 14:47:44,976 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:44,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:44,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:44,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:44,976 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 14:47:45,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:45,042 INFO L93 Difference]: Finished difference Result 333 states and 932 transitions. [2021-06-05 14:47:45,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:45,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 14:47:45,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:45,043 INFO L225 Difference]: With dead ends: 333 [2021-06-05 14:47:45,043 INFO L226 Difference]: Without dead ends: 325 [2021-06-05 14:47:45,043 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 43.3ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:45,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-06-05 14:47:45,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2021-06-05 14:47:45,045 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 14:47:45,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 619 transitions. [2021-06-05 14:47:45,046 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 619 transitions. Word has length 19 [2021-06-05 14:47:45,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:45,046 INFO L482 AbstractCegarLoop]: Abstraction has 210 states and 619 transitions. [2021-06-05 14:47:45,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 14:47:45,046 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 619 transitions. [2021-06-05 14:47:45,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:45,046 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:45,046 INFO L521 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 14:47:45,046 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable729 [2021-06-05 14:47:45,046 INFO L430 AbstractCegarLoop]: === Iteration 371 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:45,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:45,046 INFO L82 PathProgramCache]: Analyzing trace with hash 483738231, now seen corresponding path program 81 times [2021-06-05 14:47:45,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:45,046 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346935499] [2021-06-05 14:47:45,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:45,073 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 14:47:45,073 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:45,073 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346935499] [2021-06-05 14:47:45,073 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346935499] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:45,073 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:45,073 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:45,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201272669] [2021-06-05 14:47:45,073 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:45,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:45,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:45,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:45,074 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 14:47:45,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:45,127 INFO L93 Difference]: Finished difference Result 347 states and 973 transitions. [2021-06-05 14:47:45,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:45,127 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 14:47:45,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:45,128 INFO L225 Difference]: With dead ends: 347 [2021-06-05 14:47:45,128 INFO L226 Difference]: Without dead ends: 333 [2021-06-05 14:47:45,128 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 36.2ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:45,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-06-05 14:47:45,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 208. [2021-06-05 14:47:45,130 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 14:47:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 613 transitions. [2021-06-05 14:47:45,130 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 613 transitions. Word has length 19 [2021-06-05 14:47:45,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:45,131 INFO L482 AbstractCegarLoop]: Abstraction has 208 states and 613 transitions. [2021-06-05 14:47:45,131 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 14:47:45,131 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 613 transitions. [2021-06-05 14:47:45,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:45,131 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:45,131 INFO L521 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 14:47:45,131 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable730 [2021-06-05 14:47:45,131 INFO L430 AbstractCegarLoop]: === Iteration 372 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:45,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:45,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1339481934, now seen corresponding path program 79 times [2021-06-05 14:47:45,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:45,131 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817632192] [2021-06-05 14:47:45,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:45,159 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 14:47:45,159 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:45,159 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817632192] [2021-06-05 14:47:45,159 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817632192] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:45,159 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077724204] [2021-06-05 14:47:45,159 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 14:47:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:45,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:45,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:45,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 14:47:45,236 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077724204] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:45,236 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:45,236 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:45,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118555028] [2021-06-05 14:47:45,236 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:45,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:45,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:45,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:45,236 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 14:47:45,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:45,321 INFO L93 Difference]: Finished difference Result 388 states and 1116 transitions. [2021-06-05 14:47:45,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:45,321 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 14:47:45,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:45,321 INFO L225 Difference]: With dead ends: 388 [2021-06-05 14:47:45,321 INFO L226 Difference]: Without dead ends: 388 [2021-06-05 14:47:45,322 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 71.5ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:47:45,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-06-05 14:47:45,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 214. [2021-06-05 14:47:45,324 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 14:47:45,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 637 transitions. [2021-06-05 14:47:45,324 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 637 transitions. Word has length 19 [2021-06-05 14:47:45,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:45,324 INFO L482 AbstractCegarLoop]: Abstraction has 214 states and 637 transitions. [2021-06-05 14:47:45,324 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 14:47:45,324 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 637 transitions. [2021-06-05 14:47:45,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:45,325 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:45,325 INFO L521 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 14:47:45,525 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable731,194 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:45,525 INFO L430 AbstractCegarLoop]: === Iteration 373 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:45,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:45,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2025324186, now seen corresponding path program 80 times [2021-06-05 14:47:45,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:45,525 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095057224] [2021-06-05 14:47:45,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:45,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 14:47:45,551 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:45,551 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095057224] [2021-06-05 14:47:45,551 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095057224] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:45,551 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110293211] [2021-06-05 14:47:45,551 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 14:47:45,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:45,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:45,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:45,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:45,648 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 14:47:45,649 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110293211] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:45,649 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:45,649 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:45,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924516663] [2021-06-05 14:47:45,649 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:45,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:45,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:45,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:45,649 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 14:47:45,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:45,726 INFO L93 Difference]: Finished difference Result 382 states and 1089 transitions. [2021-06-05 14:47:45,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:45,726 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 14:47:45,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:45,726 INFO L225 Difference]: With dead ends: 382 [2021-06-05 14:47:45,726 INFO L226 Difference]: Without dead ends: 376 [2021-06-05 14:47:45,726 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 73.8ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:47:45,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-06-05 14:47:45,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 211. [2021-06-05 14:47:45,729 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 14:47:45,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 625 transitions. [2021-06-05 14:47:45,729 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 625 transitions. Word has length 19 [2021-06-05 14:47:45,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:45,729 INFO L482 AbstractCegarLoop]: Abstraction has 211 states and 625 transitions. [2021-06-05 14:47:45,729 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 14:47:45,729 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 625 transitions. [2021-06-05 14:47:45,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:45,729 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:45,729 INFO L521 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 14:47:45,930 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 195 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable732 [2021-06-05 14:47:45,930 INFO L430 AbstractCegarLoop]: === Iteration 374 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:45,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:45,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1256950578, now seen corresponding path program 81 times [2021-06-05 14:47:45,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:45,930 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090354934] [2021-06-05 14:47:45,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:45,952 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 14:47:45,952 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:45,953 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090354934] [2021-06-05 14:47:45,953 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090354934] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:45,953 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010845229] [2021-06-05 14:47:45,953 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 14:47:45,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:47:45,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:45,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:45,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:46,024 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 14:47:46,024 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010845229] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:46,024 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:46,024 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:47:46,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684417587] [2021-06-05 14:47:46,024 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:47:46,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:46,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:47:46,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:46,025 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 14:47:46,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:46,100 INFO L93 Difference]: Finished difference Result 370 states and 1047 transitions. [2021-06-05 14:47:46,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:46,100 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 14:47:46,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:46,100 INFO L225 Difference]: With dead ends: 370 [2021-06-05 14:47:46,101 INFO L226 Difference]: Without dead ends: 358 [2021-06-05 14:47:46,101 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 55.5ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:46,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-06-05 14:47:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 208. [2021-06-05 14:47:46,103 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 14:47:46,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 613 transitions. [2021-06-05 14:47:46,103 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 613 transitions. Word has length 19 [2021-06-05 14:47:46,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:46,103 INFO L482 AbstractCegarLoop]: Abstraction has 208 states and 613 transitions. [2021-06-05 14:47:46,103 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 14:47:46,103 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 613 transitions. [2021-06-05 14:47:46,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:46,104 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:46,104 INFO L521 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 14:47:46,317 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable735,196 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:46,317 INFO L430 AbstractCegarLoop]: === Iteration 375 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:46,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:46,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1258244423, now seen corresponding path program 82 times [2021-06-05 14:47:46,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:46,317 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905102611] [2021-06-05 14:47:46,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:46,342 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 14:47:46,342 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:46,342 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905102611] [2021-06-05 14:47:46,342 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905102611] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:46,342 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:46,342 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:46,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990186433] [2021-06-05 14:47:46,343 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:46,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:46,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:46,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:46,343 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 14:47:46,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:46,423 INFO L93 Difference]: Finished difference Result 371 states and 1007 transitions. [2021-06-05 14:47:46,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:46,423 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 14:47:46,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:46,424 INFO L225 Difference]: With dead ends: 371 [2021-06-05 14:47:46,424 INFO L226 Difference]: Without dead ends: 363 [2021-06-05 14:47:46,424 INFO L777 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 14:47:46,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-06-05 14:47:46,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 218. [2021-06-05 14:47:46,426 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 14:47:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 648 transitions. [2021-06-05 14:47:46,426 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 648 transitions. Word has length 19 [2021-06-05 14:47:46,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:46,426 INFO L482 AbstractCegarLoop]: Abstraction has 218 states and 648 transitions. [2021-06-05 14:47:46,426 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 14:47:46,426 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 648 transitions. [2021-06-05 14:47:46,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:46,427 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:46,427 INFO L521 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 14:47:46,427 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable738 [2021-06-05 14:47:46,427 INFO L430 AbstractCegarLoop]: === Iteration 376 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:46,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:46,427 INFO L82 PathProgramCache]: Analyzing trace with hash -877506783, now seen corresponding path program 83 times [2021-06-05 14:47:46,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:46,427 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65508317] [2021-06-05 14:47:46,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:46,471 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 14:47:46,471 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:46,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65508317] [2021-06-05 14:47:46,471 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65508317] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:46,471 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:46,471 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:46,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599866655] [2021-06-05 14:47:46,471 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:46,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:46,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:46,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:46,472 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 14:47:46,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:46,551 INFO L93 Difference]: Finished difference Result 377 states and 1022 transitions. [2021-06-05 14:47:46,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:46,552 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 14:47:46,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:46,552 INFO L225 Difference]: With dead ends: 377 [2021-06-05 14:47:46,552 INFO L226 Difference]: Without dead ends: 369 [2021-06-05 14:47:46,552 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 49.9ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:46,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-06-05 14:47:46,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 220. [2021-06-05 14:47:46,554 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 14:47:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 652 transitions. [2021-06-05 14:47:46,555 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 652 transitions. Word has length 19 [2021-06-05 14:47:46,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:46,555 INFO L482 AbstractCegarLoop]: Abstraction has 220 states and 652 transitions. [2021-06-05 14:47:46,555 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 14:47:46,555 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 652 transitions. [2021-06-05 14:47:46,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:46,555 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:46,555 INFO L521 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 14:47:46,555 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable739 [2021-06-05 14:47:46,555 INFO L430 AbstractCegarLoop]: === Iteration 377 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:46,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:46,556 INFO L82 PathProgramCache]: Analyzing trace with hash 674118506, now seen corresponding path program 82 times [2021-06-05 14:47:46,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:46,556 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847411457] [2021-06-05 14:47:46,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:46,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 14:47:46,584 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:46,584 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847411457] [2021-06-05 14:47:46,584 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847411457] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:46,584 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504177630] [2021-06-05 14:47:46,584 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 14:47:46,609 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:47:46,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:46,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:46,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:46,662 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 14:47:46,663 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504177630] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:46,663 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:46,663 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:46,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054531221] [2021-06-05 14:47:46,663 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:46,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:46,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:46,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:46,663 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 14:47:46,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:46,781 INFO L93 Difference]: Finished difference Result 433 states and 1227 transitions. [2021-06-05 14:47:46,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:46,781 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 14:47:46,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:46,782 INFO L225 Difference]: With dead ends: 433 [2021-06-05 14:47:46,782 INFO L226 Difference]: Without dead ends: 433 [2021-06-05 14:47:46,782 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 69.3ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:46,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-06-05 14:47:46,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 226. [2021-06-05 14:47:46,785 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 14:47:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 679 transitions. [2021-06-05 14:47:46,785 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 679 transitions. Word has length 19 [2021-06-05 14:47:46,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:46,785 INFO L482 AbstractCegarLoop]: Abstraction has 226 states and 679 transitions. [2021-06-05 14:47:46,785 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 14:47:46,785 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 679 transitions. [2021-06-05 14:47:46,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:46,785 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:46,785 INFO L521 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 14:47:47,001 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 197 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable740 [2021-06-05 14:47:47,001 INFO L430 AbstractCegarLoop]: === Iteration 378 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:47,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:47,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1604279682, now seen corresponding path program 83 times [2021-06-05 14:47:47,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:47,002 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620152557] [2021-06-05 14:47:47,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:47,032 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 14:47:47,032 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:47,032 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620152557] [2021-06-05 14:47:47,032 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620152557] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:47,032 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002636747] [2021-06-05 14:47:47,032 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 14:47:47,059 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:47,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:47,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:47,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:47,112 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 14:47:47,112 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002636747] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:47,112 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:47,112 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:47,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754557485] [2021-06-05 14:47:47,112 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:47,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:47,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:47,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:47,113 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 14:47:47,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:47,182 INFO L93 Difference]: Finished difference Result 415 states and 1158 transitions. [2021-06-05 14:47:47,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:47,182 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 14:47:47,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:47,183 INFO L225 Difference]: With dead ends: 415 [2021-06-05 14:47:47,183 INFO L226 Difference]: Without dead ends: 409 [2021-06-05 14:47:47,183 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 66.9ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:47,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-06-05 14:47:47,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 225. [2021-06-05 14:47:47,185 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 14:47:47,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 674 transitions. [2021-06-05 14:47:47,185 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 674 transitions. Word has length 19 [2021-06-05 14:47:47,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:47,186 INFO L482 AbstractCegarLoop]: Abstraction has 225 states and 674 transitions. [2021-06-05 14:47:47,186 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 14:47:47,186 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 674 transitions. [2021-06-05 14:47:47,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:47,186 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:47,186 INFO L521 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 14:47:47,386 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 198 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable741 [2021-06-05 14:47:47,386 INFO L430 AbstractCegarLoop]: === Iteration 379 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:47,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:47,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1462378563, now seen corresponding path program 84 times [2021-06-05 14:47:47,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:47,387 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655813964] [2021-06-05 14:47:47,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:47,416 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 14:47:47,416 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:47,416 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655813964] [2021-06-05 14:47:47,416 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655813964] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:47,416 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361592796] [2021-06-05 14:47:47,416 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 14:47:47,440 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:47:47,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:47,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:47,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:47,492 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 14:47:47,492 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361592796] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:47,492 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:47,492 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:47,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391251176] [2021-06-05 14:47:47,492 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:47,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:47,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:47,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:47,492 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 14:47:47,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:47,566 INFO L93 Difference]: Finished difference Result 343 states and 948 transitions. [2021-06-05 14:47:47,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:47,566 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 14:47:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:47,567 INFO L225 Difference]: With dead ends: 343 [2021-06-05 14:47:47,567 INFO L226 Difference]: Without dead ends: 335 [2021-06-05 14:47:47,567 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 64.3ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-06-05 14:47:47,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 222. [2021-06-05 14:47:47,569 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 14:47:47,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 663 transitions. [2021-06-05 14:47:47,569 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 663 transitions. Word has length 19 [2021-06-05 14:47:47,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:47,569 INFO L482 AbstractCegarLoop]: Abstraction has 222 states and 663 transitions. [2021-06-05 14:47:47,569 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 14:47:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 663 transitions. [2021-06-05 14:47:47,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:47,570 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:47,570 INFO L521 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 14:47:47,770 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable744,199 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:47,770 INFO L430 AbstractCegarLoop]: === Iteration 380 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:47,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:47,771 INFO L82 PathProgramCache]: Analyzing trace with hash 874518162, now seen corresponding path program 84 times [2021-06-05 14:47:47,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:47,771 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309405693] [2021-06-05 14:47:47,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:47,826 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 14:47:47,826 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:47,826 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309405693] [2021-06-05 14:47:47,826 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309405693] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:47,826 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007827448] [2021-06-05 14:47:47,826 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 14:47:47,860 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:47:47,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:47,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:47,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:47,928 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 14:47:47,928 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007827448] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:47,928 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:47,928 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:47,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058169180] [2021-06-05 14:47:47,928 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:47,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:47,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:47,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:47,928 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 14:47:48,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:48,005 INFO L93 Difference]: Finished difference Result 360 states and 1019 transitions. [2021-06-05 14:47:48,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:48,006 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 14:47:48,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:48,006 INFO L225 Difference]: With dead ends: 360 [2021-06-05 14:47:48,006 INFO L226 Difference]: Without dead ends: 360 [2021-06-05 14:47:48,006 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 76.7ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-06-05 14:47:48,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 213. [2021-06-05 14:47:48,008 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 14:47:48,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 633 transitions. [2021-06-05 14:47:48,009 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 633 transitions. Word has length 19 [2021-06-05 14:47:48,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:48,009 INFO L482 AbstractCegarLoop]: Abstraction has 213 states and 633 transitions. [2021-06-05 14:47:48,009 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 14:47:48,009 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 633 transitions. [2021-06-05 14:47:48,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:48,009 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:48,009 INFO L521 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 14:47:48,209 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 200 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable747 [2021-06-05 14:47:48,210 INFO L430 AbstractCegarLoop]: === Iteration 381 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:48,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:48,210 INFO L82 PathProgramCache]: Analyzing trace with hash 793277490, now seen corresponding path program 85 times [2021-06-05 14:47:48,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:48,210 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309985011] [2021-06-05 14:47:48,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:48,235 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 14:47:48,235 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:48,235 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309985011] [2021-06-05 14:47:48,235 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309985011] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:48,235 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741560421] [2021-06-05 14:47:48,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 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 14:47:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:48,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:48,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:48,311 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 14:47:48,311 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741560421] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:48,311 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:48,311 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:48,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067105830] [2021-06-05 14:47:48,311 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:48,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:48,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:48,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:48,312 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 14:47:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:48,390 INFO L93 Difference]: Finished difference Result 315 states and 891 transitions. [2021-06-05 14:47:48,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:48,390 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 14:47:48,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:48,390 INFO L225 Difference]: With dead ends: 315 [2021-06-05 14:47:48,390 INFO L226 Difference]: Without dead ends: 306 [2021-06-05 14:47:48,390 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 69.3ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:48,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-06-05 14:47:48,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 213. [2021-06-05 14:47:48,392 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 14:47:48,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 629 transitions. [2021-06-05 14:47:48,393 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 629 transitions. Word has length 19 [2021-06-05 14:47:48,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:48,393 INFO L482 AbstractCegarLoop]: Abstraction has 213 states and 629 transitions. [2021-06-05 14:47:48,393 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 14:47:48,393 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 629 transitions. [2021-06-05 14:47:48,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:48,393 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:48,393 INFO L521 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 14:47:48,593 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable748,201 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:47:48,594 INFO L430 AbstractCegarLoop]: === Iteration 382 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:48,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:48,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1182384003, now seen corresponding path program 85 times [2021-06-05 14:47:48,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:48,594 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061401899] [2021-06-05 14:47:48,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:48,625 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 14:47:48,625 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:48,625 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061401899] [2021-06-05 14:47:48,625 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061401899] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:48,625 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747971866] [2021-06-05 14:47:48,625 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 14:47:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:48,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:47:48,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:48,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 14:47:48,708 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747971866] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:48,708 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:48,708 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:47:48,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300806445] [2021-06-05 14:47:48,708 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:47:48,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:48,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:47:48,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:48,708 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 14:47:48,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:48,781 INFO L93 Difference]: Finished difference Result 302 states and 860 transitions. [2021-06-05 14:47:48,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:48,781 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 14:47:48,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:48,782 INFO L225 Difference]: With dead ends: 302 [2021-06-05 14:47:48,782 INFO L226 Difference]: Without dead ends: 302 [2021-06-05 14:47:48,782 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 68.1ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:47:48,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-06-05 14:47:48,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 209. [2021-06-05 14:47:48,784 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 14:47:48,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 617 transitions. [2021-06-05 14:47:48,784 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 617 transitions. Word has length 19 [2021-06-05 14:47:48,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:48,784 INFO L482 AbstractCegarLoop]: Abstraction has 209 states and 617 transitions. [2021-06-05 14:47:48,784 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 14:47:48,784 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 617 transitions. [2021-06-05 14:47:48,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:48,785 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:48,785 INFO L521 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 14:47:48,985 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 202 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable751 [2021-06-05 14:47:48,985 INFO L430 AbstractCegarLoop]: === Iteration 383 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:48,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:48,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1417121330, now seen corresponding path program 86 times [2021-06-05 14:47:48,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:48,986 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759947218] [2021-06-05 14:47:48,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:49,010 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 14:47:49,010 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:49,010 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759947218] [2021-06-05 14:47:49,010 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759947218] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:49,010 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:49,010 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:49,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420945111] [2021-06-05 14:47:49,010 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:49,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:49,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:49,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:49,011 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 14:47:49,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:49,103 INFO L93 Difference]: Finished difference Result 353 states and 973 transitions. [2021-06-05 14:47:49,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:49,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 14:47:49,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:49,103 INFO L225 Difference]: With dead ends: 353 [2021-06-05 14:47:49,103 INFO L226 Difference]: Without dead ends: 347 [2021-06-05 14:47:49,104 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 61.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:49,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-06-05 14:47:49,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 219. [2021-06-05 14:47:49,106 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 14:47:49,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 642 transitions. [2021-06-05 14:47:49,106 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 642 transitions. Word has length 19 [2021-06-05 14:47:49,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:49,106 INFO L482 AbstractCegarLoop]: Abstraction has 219 states and 642 transitions. [2021-06-05 14:47:49,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 14:47:49,108 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 642 transitions. [2021-06-05 14:47:49,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:49,108 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:49,108 INFO L521 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 14:47:49,108 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable752 [2021-06-05 14:47:49,108 INFO L430 AbstractCegarLoop]: === Iteration 384 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:49,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:49,109 INFO L82 PathProgramCache]: Analyzing trace with hash 315207178, now seen corresponding path program 87 times [2021-06-05 14:47:49,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:49,109 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105557512] [2021-06-05 14:47:49,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:49,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 14:47:49,133 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:49,133 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105557512] [2021-06-05 14:47:49,133 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105557512] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:49,133 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:49,133 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:49,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647686705] [2021-06-05 14:47:49,133 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:49,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:49,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:49,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:49,134 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 14:47:49,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:49,221 INFO L93 Difference]: Finished difference Result 317 states and 890 transitions. [2021-06-05 14:47:49,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:49,222 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 14:47:49,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:49,224 INFO L225 Difference]: With dead ends: 317 [2021-06-05 14:47:49,224 INFO L226 Difference]: Without dead ends: 306 [2021-06-05 14:47:49,224 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 61.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:49,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-06-05 14:47:49,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 209. [2021-06-05 14:47:49,229 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 14:47:49,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 616 transitions. [2021-06-05 14:47:49,229 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 616 transitions. Word has length 19 [2021-06-05 14:47:49,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:49,230 INFO L482 AbstractCegarLoop]: Abstraction has 209 states and 616 transitions. [2021-06-05 14:47:49,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 14:47:49,230 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 616 transitions. [2021-06-05 14:47:49,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:49,230 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:49,230 INFO L521 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 14:47:49,230 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable753 [2021-06-05 14:47:49,230 INFO L430 AbstractCegarLoop]: === Iteration 385 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:49,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:49,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2141133541, now seen corresponding path program 86 times [2021-06-05 14:47:49,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:49,230 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458621486] [2021-06-05 14:47:49,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:49,255 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 14:47:49,255 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:49,256 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458621486] [2021-06-05 14:47:49,256 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458621486] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:49,256 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:49,256 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:49,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320667482] [2021-06-05 14:47:49,256 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:49,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:49,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:49,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:49,256 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 14:47:49,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:49,328 INFO L93 Difference]: Finished difference Result 353 states and 981 transitions. [2021-06-05 14:47:49,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:49,329 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 14:47:49,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:49,329 INFO L225 Difference]: With dead ends: 353 [2021-06-05 14:47:49,329 INFO L226 Difference]: Without dead ends: 347 [2021-06-05 14:47:49,329 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 40.2ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:49,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-06-05 14:47:49,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 221. [2021-06-05 14:47:49,331 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 14:47:49,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 653 transitions. [2021-06-05 14:47:49,332 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 653 transitions. Word has length 19 [2021-06-05 14:47:49,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:49,332 INFO L482 AbstractCegarLoop]: Abstraction has 221 states and 653 transitions. [2021-06-05 14:47:49,332 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 14:47:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 653 transitions. [2021-06-05 14:47:49,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:49,332 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:49,332 INFO L521 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 14:47:49,332 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable754 [2021-06-05 14:47:49,333 INFO L430 AbstractCegarLoop]: === Iteration 386 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:49,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:49,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1883324063, now seen corresponding path program 87 times [2021-06-05 14:47:49,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:49,333 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169344931] [2021-06-05 14:47:49,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:49,361 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 14:47:49,361 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:49,361 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169344931] [2021-06-05 14:47:49,361 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169344931] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:49,361 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:49,361 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:49,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15133564] [2021-06-05 14:47:49,361 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:49,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:49,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:49,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:49,362 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 14:47:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:49,434 INFO L93 Difference]: Finished difference Result 331 states and 944 transitions. [2021-06-05 14:47:49,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:49,434 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 14:47:49,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:49,435 INFO L225 Difference]: With dead ends: 331 [2021-06-05 14:47:49,435 INFO L226 Difference]: Without dead ends: 331 [2021-06-05 14:47:49,435 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 41.7ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:49,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-06-05 14:47:49,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 208. [2021-06-05 14:47:49,437 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 14:47:49,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 613 transitions. [2021-06-05 14:47:49,437 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 613 transitions. Word has length 19 [2021-06-05 14:47:49,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:49,438 INFO L482 AbstractCegarLoop]: Abstraction has 208 states and 613 transitions. [2021-06-05 14:47:49,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 14:47:49,438 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 613 transitions. [2021-06-05 14:47:49,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:49,438 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:49,438 INFO L521 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 14:47:49,438 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable755 [2021-06-05 14:47:49,438 INFO L430 AbstractCegarLoop]: === Iteration 387 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:49,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:49,438 INFO L82 PathProgramCache]: Analyzing trace with hash -249991038, now seen corresponding path program 88 times [2021-06-05 14:47:49,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:49,438 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008436644] [2021-06-05 14:47:49,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:49,459 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 14:47:49,459 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:49,459 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008436644] [2021-06-05 14:47:49,459 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008436644] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:49,459 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:49,459 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:49,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358727148] [2021-06-05 14:47:49,459 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:49,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:49,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:49,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:49,460 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 14:47:49,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:49,546 INFO L93 Difference]: Finished difference Result 292 states and 822 transitions. [2021-06-05 14:47:49,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:49,546 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 14:47:49,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:49,546 INFO L225 Difference]: With dead ends: 292 [2021-06-05 14:47:49,546 INFO L226 Difference]: Without dead ends: 280 [2021-06-05 14:47:49,546 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 58.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:49,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-06-05 14:47:49,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 210. [2021-06-05 14:47:49,548 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 14:47:49,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 616 transitions. [2021-06-05 14:47:49,549 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 616 transitions. Word has length 19 [2021-06-05 14:47:49,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:49,549 INFO L482 AbstractCegarLoop]: Abstraction has 210 states and 616 transitions. [2021-06-05 14:47:49,549 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 14:47:49,549 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 616 transitions. [2021-06-05 14:47:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:49,549 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:49,549 INFO L521 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 14:47:49,549 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable756 [2021-06-05 14:47:49,549 INFO L430 AbstractCegarLoop]: === Iteration 388 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:49,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:49,550 INFO L82 PathProgramCache]: Analyzing trace with hash 144187622, now seen corresponding path program 89 times [2021-06-05 14:47:49,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:49,550 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493414502] [2021-06-05 14:47:49,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:49,573 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 14:47:49,573 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:49,573 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493414502] [2021-06-05 14:47:49,573 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493414502] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:49,573 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:49,573 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:49,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148985534] [2021-06-05 14:47:49,573 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:49,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:49,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:49,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:49,573 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 14:47:49,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:49,664 INFO L93 Difference]: Finished difference Result 280 states and 784 transitions. [2021-06-05 14:47:49,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:49,664 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 14:47:49,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:49,665 INFO L225 Difference]: With dead ends: 280 [2021-06-05 14:47:49,665 INFO L226 Difference]: Without dead ends: 274 [2021-06-05 14:47:49,665 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 70.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:49,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-06-05 14:47:49,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 220. [2021-06-05 14:47:49,667 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 14:47:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 641 transitions. [2021-06-05 14:47:49,667 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 641 transitions. Word has length 19 [2021-06-05 14:47:49,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:49,667 INFO L482 AbstractCegarLoop]: Abstraction has 220 states and 641 transitions. [2021-06-05 14:47:49,667 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 14:47:49,667 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 641 transitions. [2021-06-05 14:47:49,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:49,668 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:49,668 INFO L521 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 14:47:49,668 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable757 [2021-06-05 14:47:49,668 INFO L430 AbstractCegarLoop]: === Iteration 389 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:49,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:49,668 INFO L82 PathProgramCache]: Analyzing trace with hash -957726530, now seen corresponding path program 90 times [2021-06-05 14:47:49,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:49,668 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285155425] [2021-06-05 14:47:49,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:49,691 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 14:47:49,691 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:49,691 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285155425] [2021-06-05 14:47:49,691 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285155425] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:49,691 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:49,691 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:49,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715300285] [2021-06-05 14:47:49,691 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:49,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:49,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:49,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:49,691 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 14:47:49,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:49,766 INFO L93 Difference]: Finished difference Result 244 states and 701 transitions. [2021-06-05 14:47:49,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:49,766 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 14:47:49,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:49,767 INFO L225 Difference]: With dead ends: 244 [2021-06-05 14:47:49,767 INFO L226 Difference]: Without dead ends: 231 [2021-06-05 14:47:49,767 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 64.9ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:47:49,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-06-05 14:47:49,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 208. [2021-06-05 14:47:49,769 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 14:47:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 612 transitions. [2021-06-05 14:47:49,769 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 612 transitions. Word has length 19 [2021-06-05 14:47:49,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:49,769 INFO L482 AbstractCegarLoop]: Abstraction has 208 states and 612 transitions. [2021-06-05 14:47:49,769 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 14:47:49,769 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 612 transitions. [2021-06-05 14:47:49,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:49,769 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:49,769 INFO L521 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 14:47:49,769 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable758 [2021-06-05 14:47:49,769 INFO L430 AbstractCegarLoop]: === Iteration 390 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:49,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:49,770 INFO L82 PathProgramCache]: Analyzing trace with hash -427692237, now seen corresponding path program 88 times [2021-06-05 14:47:49,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:49,770 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520942657] [2021-06-05 14:47:49,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:49,798 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 14:47:49,798 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:49,798 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520942657] [2021-06-05 14:47:49,798 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520942657] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:49,798 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:49,798 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:49,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687414053] [2021-06-05 14:47:49,798 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:49,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:49,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:49,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:49,799 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 14:47:49,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:49,854 INFO L93 Difference]: Finished difference Result 277 states and 780 transitions. [2021-06-05 14:47:49,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:49,854 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 14:47:49,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:49,855 INFO L225 Difference]: With dead ends: 277 [2021-06-05 14:47:49,855 INFO L226 Difference]: Without dead ends: 265 [2021-06-05 14:47:49,855 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 36.0ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:49,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-06-05 14:47:49,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 208. [2021-06-05 14:47:49,857 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 14:47:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 611 transitions. [2021-06-05 14:47:49,857 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 611 transitions. Word has length 19 [2021-06-05 14:47:49,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:49,857 INFO L482 AbstractCegarLoop]: Abstraction has 208 states and 611 transitions. [2021-06-05 14:47:49,857 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 14:47:49,857 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 611 transitions. [2021-06-05 14:47:49,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:49,857 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:49,857 INFO L521 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 14:47:49,857 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable759 [2021-06-05 14:47:49,857 INFO L430 AbstractCegarLoop]: === Iteration 391 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:49,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:49,858 INFO L82 PathProgramCache]: Analyzing trace with hash 656044215, now seen corresponding path program 89 times [2021-06-05 14:47:49,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:49,858 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206478508] [2021-06-05 14:47:49,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:49,884 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 14:47:49,885 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:49,885 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206478508] [2021-06-05 14:47:49,885 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206478508] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:49,885 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:49,885 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:49,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554572333] [2021-06-05 14:47:49,885 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:49,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:49,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:49,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:49,885 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 14:47:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:49,953 INFO L93 Difference]: Finished difference Result 281 states and 792 transitions. [2021-06-05 14:47:49,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:49,953 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 14:47:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:49,953 INFO L225 Difference]: With dead ends: 281 [2021-06-05 14:47:49,953 INFO L226 Difference]: Without dead ends: 275 [2021-06-05 14:47:49,953 INFO L777 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 14:47:49,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-06-05 14:47:49,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 214. [2021-06-05 14:47:49,955 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 14:47:49,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 625 transitions. [2021-06-05 14:47:49,956 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 625 transitions. Word has length 19 [2021-06-05 14:47:49,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:49,956 INFO L482 AbstractCegarLoop]: Abstraction has 214 states and 625 transitions. [2021-06-05 14:47:49,956 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 14:47:49,956 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 625 transitions. [2021-06-05 14:47:49,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:47:49,956 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:49,956 INFO L521 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 14:47:49,956 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable760 [2021-06-05 14:47:49,956 INFO L430 AbstractCegarLoop]: === Iteration 392 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:49,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:49,956 INFO L82 PathProgramCache]: Analyzing trace with hash 926553907, now seen corresponding path program 90 times [2021-06-05 14:47:49,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:49,957 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770512518] [2021-06-05 14:47:49,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:49,988 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 14:47:49,988 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:49,988 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770512518] [2021-06-05 14:47:49,988 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770512518] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:47:49,988 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:47:49,988 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:47:49,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047424893] [2021-06-05 14:47:49,988 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:47:49,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:49,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:47:49,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:47:49,989 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 14:47:50,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:50,057 INFO L93 Difference]: Finished difference Result 246 states and 717 transitions. [2021-06-05 14:47:50,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:47:50,058 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 14:47:50,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:50,058 INFO L225 Difference]: With dead ends: 246 [2021-06-05 14:47:50,058 INFO L226 Difference]: Without dead ends: 246 [2021-06-05 14:47:50,058 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 42.1ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:47:50,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-06-05 14:47:50,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 189. [2021-06-05 14:47:50,060 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 14:47:50,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 549 transitions. [2021-06-05 14:47:50,060 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 549 transitions. Word has length 19 [2021-06-05 14:47:50,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:50,060 INFO L482 AbstractCegarLoop]: Abstraction has 189 states and 549 transitions. [2021-06-05 14:47:50,060 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 14:47:50,060 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 549 transitions. [2021-06-05 14:47:50,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:47:50,061 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:50,061 INFO L521 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 14:47:50,061 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable761 [2021-06-05 14:47:50,061 INFO L430 AbstractCegarLoop]: === Iteration 393 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:50,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:50,061 INFO L82 PathProgramCache]: Analyzing trace with hash 92049292, now seen corresponding path program 1 times [2021-06-05 14:47:50,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:50,061 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371282976] [2021-06-05 14:47:50,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:50,533 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 14:47:50,533 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:50,533 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371282976] [2021-06-05 14:47:50,533 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371282976] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:50,533 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354704266] [2021-06-05 14:47:50,533 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 14:47:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:50,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:47:50,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:50,960 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:50,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:50,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:47:50,967 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:47:50,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:50,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:50,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 23 treesize of output 17 [2021-06-05 14:47:50,974 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:47:50,978 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:50,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:47:50,980 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:47:51,176 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2021-06-05 14:47:51,177 INFO L628 ElimStorePlain]: treesize reduction 108, result has 72.6 percent of original size [2021-06-05 14:47:51,181 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:51,182 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:51,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:47:51,184 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:47:51,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:51,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 23 treesize of output 17 [2021-06-05 14:47:51,188 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:47:51,275 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:47:51,279 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:51,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 15 treesize of output 11 [2021-06-05 14:47:51,283 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:47:51,363 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:47:51,367 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:51,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:47:51,369 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:47:51,447 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:47:51,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:51,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:47:51,452 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:47:51,532 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:47:51,538 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:51,538 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:51,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 31 treesize of output 23 [2021-06-05 14:47:51,540 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:47:51,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:51,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 14:47:51,546 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:47:51,615 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:47:51,627 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 14:47:51,627 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:469, output treesize:196 [2021-06-05 14:47:51,776 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2021-06-05 14:47:52,364 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 14:47:52,364 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354704266] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:52,364 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:52,364 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:47:52,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099969590] [2021-06-05 14:47:52,365 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:47:52,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:52,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:47:52,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:47:52,365 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 14:47:52,583 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-06-05 14:47:52,769 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2021-06-05 14:47:53,152 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 130 [2021-06-05 14:47:53,628 WARN L205 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 135 [2021-06-05 14:47:54,064 WARN L205 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 115 [2021-06-05 14:47:54,569 WARN L205 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 142 [2021-06-05 14:47:54,875 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 115 [2021-06-05 14:47:55,454 WARN L205 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 160 [2021-06-05 14:47:55,755 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 112 [2021-06-05 14:47:56,389 WARN L205 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 167 [2021-06-05 14:47:57,095 WARN L205 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 161 [2021-06-05 14:47:57,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:47:57,162 INFO L93 Difference]: Finished difference Result 540 states and 1464 transitions. [2021-06-05 14:47:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 14:47:57,162 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 14:47:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:47:57,163 INFO L225 Difference]: With dead ends: 540 [2021-06-05 14:47:57,163 INFO L226 Difference]: Without dead ends: 380 [2021-06-05 14:47:57,163 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 5332.7ms TimeCoverageRelationStatistics Valid=193, Invalid=737, Unknown=0, NotChecked=0, Total=930 [2021-06-05 14:47:57,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-06-05 14:47:57,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 249. [2021-06-05 14:47:57,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 2.8588709677419355) internal successors, (709), 248 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 14:47:57,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 709 transitions. [2021-06-05 14:47:57,166 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 709 transitions. Word has length 20 [2021-06-05 14:47:57,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:47:57,166 INFO L482 AbstractCegarLoop]: Abstraction has 249 states and 709 transitions. [2021-06-05 14:47:57,166 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 14:47:57,166 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 709 transitions. [2021-06-05 14:47:57,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:47:57,166 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:47:57,166 INFO L521 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 14:47:57,366 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 203 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable762 [2021-06-05 14:47:57,366 INFO L430 AbstractCegarLoop]: === Iteration 394 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:47:57,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:47:57,367 INFO L82 PathProgramCache]: Analyzing trace with hash -304868362, now seen corresponding path program 2 times [2021-06-05 14:47:57,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:47:57,367 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554160442] [2021-06-05 14:47:57,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:47:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:47:57,718 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 14:47:57,718 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:47:57,718 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554160442] [2021-06-05 14:47:57,718 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554160442] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:57,718 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5160104] [2021-06-05 14:47:57,718 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 14:47:57,744 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:47:57,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:47:57,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:47:57,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:47:58,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:58,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 14:47:58,080 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:47:58,291 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2021-06-05 14:47:58,291 INFO L628 ElimStorePlain]: treesize reduction 156, result has 66.2 percent of original size [2021-06-05 14:47:58,295 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:58,296 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:58,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 14:47:58,298 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:47:58,302 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:58,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 23 treesize of output 17 [2021-06-05 14:47:58,305 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:47:58,397 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:47:58,401 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:58,402 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:58,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:47:58,403 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:47:58,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:58,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 31 treesize of output 23 [2021-06-05 14:47:58,409 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:47:58,490 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:47:58,495 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:58,495 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:58,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 23 treesize of output 17 [2021-06-05 14:47:58,497 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:47:58,500 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:58,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:47:58,501 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:47:58,572 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:47:58,575 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:58,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:47:58,578 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:47:58,647 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:47:58,650 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:47:58,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:47:58,651 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:47:58,719 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:47:58,725 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 14:47:58,725 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:469, output treesize:196 [2021-06-05 14:47:58,885 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2021-06-05 14:47:59,361 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2021-06-05 14:47:59,529 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 14:47:59,529 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5160104] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:47:59,529 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:47:59,529 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:47:59,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438304755] [2021-06-05 14:47:59,529 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:47:59,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:47:59,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:47:59,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:47:59,530 INFO L87 Difference]: Start difference. First operand 249 states and 709 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 14:47:59,752 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2021-06-05 14:47:59,944 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2021-06-05 14:48:00,323 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 136 [2021-06-05 14:48:00,963 WARN L205 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 142 [2021-06-05 14:48:01,627 WARN L205 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 145 [2021-06-05 14:48:02,376 WARN L205 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 153 [2021-06-05 14:48:03,197 WARN L205 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 162 [2021-06-05 14:48:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:48:03,227 INFO L93 Difference]: Finished difference Result 438 states and 1180 transitions. [2021-06-05 14:48:03,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:48:03,227 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 14:48:03,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:48:03,228 INFO L225 Difference]: With dead ends: 438 [2021-06-05 14:48:03,228 INFO L226 Difference]: Without dead ends: 417 [2021-06-05 14:48:03,228 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 4339.3ms TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:48:03,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2021-06-05 14:48:03,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 255. [2021-06-05 14:48:03,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 2.854330708661417) internal successors, (725), 254 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:48:03,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 725 transitions. [2021-06-05 14:48:03,231 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 725 transitions. Word has length 20 [2021-06-05 14:48:03,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:48:03,231 INFO L482 AbstractCegarLoop]: Abstraction has 255 states and 725 transitions. [2021-06-05 14:48:03,231 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 14:48:03,231 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 725 transitions. [2021-06-05 14:48:03,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:48:03,231 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:48:03,231 INFO L521 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 14:48:03,436 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable839,204 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:48:03,437 INFO L430 AbstractCegarLoop]: === Iteration 395 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:48:03,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:48:03,437 INFO L82 PathProgramCache]: Analyzing trace with hash -2003588750, now seen corresponding path program 3 times [2021-06-05 14:48:03,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:48:03,437 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542205493] [2021-06-05 14:48:03,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:48:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:48:03,830 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 14:48:03,830 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:48:03,830 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542205493] [2021-06-05 14:48:03,830 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542205493] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:48:03,830 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068156502] [2021-06-05 14:48:03,830 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 14:48:03,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:48:03,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:48:03,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:48:03,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:48:04,553 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:04,554 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:04,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:04,555 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:04,561 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:04,561 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:04,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 30 treesize of output 22 [2021-06-05 14:48:04,563 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:04,568 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:04,569 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:04,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:04,569 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:04,575 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:04,576 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:04,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:04,577 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:04,582 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:04,583 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:04,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 29 treesize of output 21 [2021-06-05 14:48:04,584 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:04,589 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:04,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 22 treesize of output 16 [2021-06-05 14:48:04,590 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:04,976 WARN L205 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2021-06-05 14:48:04,976 INFO L628 ElimStorePlain]: treesize reduction 540, result has 46.9 percent of original size [2021-06-05 14:48:04,981 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:04,981 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:04,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 15 treesize of output 11 [2021-06-05 14:48:04,984 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:04,993 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:04,993 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:04,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 23 treesize of output 17 [2021-06-05 14:48:04,995 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:05,000 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:05,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:05,001 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:05,286 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 81 [2021-06-05 14:48:05,286 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.8 percent of original size [2021-06-05 14:48:05,290 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:05,291 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:05,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:05,292 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:05,296 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:05,296 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:05,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 14:48:05,297 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:05,302 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:05,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 23 treesize of output 17 [2021-06-05 14:48:05,303 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:05,447 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-06-05 14:48:05,447 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:05,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:05,452 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:05,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:05,453 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:05,457 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:05,458 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:05,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:05,459 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:05,462 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:05,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 23 treesize of output 17 [2021-06-05 14:48:05,463 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:05,695 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2021-06-05 14:48:05,696 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.7 percent of original size [2021-06-05 14:48:05,707 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 14:48:05,707 INFO L247 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:1129, output treesize:336 [2021-06-05 14:48:06,108 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2021-06-05 14:48:06,427 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_82, v_prenex_60, v_prenex_70, v_prenex_80, v_prenex_76, v_prenex_74, v_prenex_84, v_prenex_58, v_prenex_68, v_prenex_78, v_prenex_66, v_prenex_90], 1=[v_prenex_83, v_prenex_81, v_prenex_87, v_prenex_65, v_prenex_75, v_prenex_73, v_prenex_69, v_prenex_79, v_prenex_57, v_prenex_67, v_prenex_77, v_prenex_59]} [2021-06-05 14:48:06,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 14:48:06,439 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:06,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 23 treesize of output 17 [2021-06-05 14:48:06,449 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:06,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 23 treesize of output 17 [2021-06-05 14:48:06,459 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:06,907 WARN L205 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 107 [2021-06-05 14:48:06,908 INFO L628 ElimStorePlain]: treesize reduction 1017, result has 27.7 percent of original size [2021-06-05 14:48:06,908 INFO L518 ElimStorePlain]: Eliminatee v_prenex_60 vanished before elimination [2021-06-05 14:48:06,908 INFO L518 ElimStorePlain]: Eliminatee v_prenex_70 vanished before elimination [2021-06-05 14:48:06,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 7 treesize of output 5 [2021-06-05 14:48:06,914 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:07,045 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-06-05 14:48:07,045 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:07,045 INFO L518 ElimStorePlain]: Eliminatee v_prenex_76 vanished before elimination [2021-06-05 14:48:07,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:07,051 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:07,220 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-06-05 14:48:07,221 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:07,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 14:48:07,226 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:07,364 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-06-05 14:48:07,364 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:07,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:07,377 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:07,507 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-06-05 14:48:07,507 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:07,507 INFO L518 ElimStorePlain]: Eliminatee v_prenex_68 vanished before elimination [2021-06-05 14:48:07,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 16 treesize of output 12 [2021-06-05 14:48:07,512 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:07,636 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-06-05 14:48:07,636 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:07,636 INFO L518 ElimStorePlain]: Eliminatee v_prenex_66 vanished before elimination [2021-06-05 14:48:07,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 16 treesize of output 12 [2021-06-05 14:48:07,641 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:07,760 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-06-05 14:48:07,760 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:07,760 INFO L518 ElimStorePlain]: Eliminatee v_prenex_83 vanished before elimination [2021-06-05 14:48:07,760 INFO L518 ElimStorePlain]: Eliminatee v_prenex_81 vanished before elimination [2021-06-05 14:48:07,760 INFO L518 ElimStorePlain]: Eliminatee v_prenex_87 vanished before elimination [2021-06-05 14:48:07,760 INFO L518 ElimStorePlain]: Eliminatee v_prenex_65 vanished before elimination [2021-06-05 14:48:07,761 INFO L518 ElimStorePlain]: Eliminatee v_prenex_75 vanished before elimination [2021-06-05 14:48:07,761 INFO L518 ElimStorePlain]: Eliminatee v_prenex_73 vanished before elimination [2021-06-05 14:48:07,761 INFO L518 ElimStorePlain]: Eliminatee v_prenex_69 vanished before elimination [2021-06-05 14:48:07,761 INFO L518 ElimStorePlain]: Eliminatee v_prenex_79 vanished before elimination [2021-06-05 14:48:07,761 INFO L518 ElimStorePlain]: Eliminatee v_prenex_57 vanished before elimination [2021-06-05 14:48:07,761 INFO L518 ElimStorePlain]: Eliminatee v_prenex_67 vanished before elimination [2021-06-05 14:48:07,761 INFO L518 ElimStorePlain]: Eliminatee v_prenex_77 vanished before elimination [2021-06-05 14:48:07,761 INFO L518 ElimStorePlain]: Eliminatee v_prenex_59 vanished before elimination [2021-06-05 14:48:07,765 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 14:48:07,766 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 36 variables, input treesize:1435, output treesize:283 [2021-06-05 14:48:07,895 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2021-06-05 14:48:08,093 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2021-06-05 14:48:08,186 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 14:48:08,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068156502] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:48:08,186 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:48:08,186 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:48:08,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534389707] [2021-06-05 14:48:08,186 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:48:08,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:48:08,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:48:08,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:48:08,186 INFO L87 Difference]: Start difference. First operand 255 states and 725 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 14:48:08,542 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2021-06-05 14:48:09,007 WARN L205 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 164 [2021-06-05 14:48:09,547 WARN L205 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 168 [2021-06-05 14:48:10,434 WARN L205 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 191 [2021-06-05 14:48:11,242 WARN L205 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 190 [2021-06-05 14:48:12,178 WARN L205 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 197 [2021-06-05 14:48:13,297 WARN L205 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 242 DAG size of output: 206 [2021-06-05 14:48:13,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:48:13,332 INFO L93 Difference]: Finished difference Result 470 states and 1256 transitions. [2021-06-05 14:48:13,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:48:13,333 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 14:48:13,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:48:13,333 INFO L225 Difference]: With dead ends: 470 [2021-06-05 14:48:13,333 INFO L226 Difference]: Without dead ends: 414 [2021-06-05 14:48:13,333 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 5936.0ms TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:48:13,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-06-05 14:48:13,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 266. [2021-06-05 14:48:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 2.8075471698113206) internal successors, (744), 265 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:48:13,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 744 transitions. [2021-06-05 14:48:13,336 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 744 transitions. Word has length 20 [2021-06-05 14:48:13,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:48:13,336 INFO L482 AbstractCegarLoop]: Abstraction has 266 states and 744 transitions. [2021-06-05 14:48:13,336 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 14:48:13,336 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 744 transitions. [2021-06-05 14:48:13,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:48:13,337 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:48:13,337 INFO L521 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 14:48:13,537 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable910,205 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:48:13,537 INFO L430 AbstractCegarLoop]: === Iteration 396 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:48:13,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:48:13,538 INFO L82 PathProgramCache]: Analyzing trace with hash 2118130854, now seen corresponding path program 4 times [2021-06-05 14:48:13,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:48:13,538 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881878926] [2021-06-05 14:48:13,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:48:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:48:13,801 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 14:48:13,801 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:48:13,801 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881878926] [2021-06-05 14:48:13,801 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881878926] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:48:13,802 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754221826] [2021-06-05 14:48:13,802 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 14:48:13,835 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:48:13,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:48:13,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:48:13,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:48:14,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:14,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 15 treesize of output 11 [2021-06-05 14:48:14,159 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:14,366 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2021-06-05 14:48:14,367 INFO L628 ElimStorePlain]: treesize reduction 156, result has 66.2 percent of original size [2021-06-05 14:48:14,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:14,372 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:14,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:14,373 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:14,377 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:14,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 15 treesize of output 11 [2021-06-05 14:48:14,377 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:14,468 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:14,481 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:14,482 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:14,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 14:48:14,483 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:14,487 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:14,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:14,489 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:14,568 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:14,572 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:14,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:14,573 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:14,650 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:14,654 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:14,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:14,655 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:14,729 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:14,733 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:14,733 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:14,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 15 treesize of output 11 [2021-06-05 14:48:14,735 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:14,738 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:14,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 23 treesize of output 17 [2021-06-05 14:48:14,740 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:14,811 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:14,817 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 14:48:14,817 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:469, output treesize:196 [2021-06-05 14:48:14,962 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2021-06-05 14:48:15,290 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 69 [2021-06-05 14:48:15,564 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 14:48:15,564 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754221826] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:48:15,564 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:48:15,564 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:48:15,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175231542] [2021-06-05 14:48:15,564 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:48:15,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:48:15,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:48:15,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:48:15,565 INFO L87 Difference]: Start difference. First operand 266 states and 744 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 14:48:15,976 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2021-06-05 14:48:16,344 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 129 [2021-06-05 14:48:16,786 WARN L205 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 133 [2021-06-05 14:48:17,287 WARN L205 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 140 [2021-06-05 14:48:17,721 WARN L205 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 145 [2021-06-05 14:48:18,199 WARN L205 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 154 [2021-06-05 14:48:18,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:48:18,213 INFO L93 Difference]: Finished difference Result 412 states and 1120 transitions. [2021-06-05 14:48:18,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:48:18,214 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 14:48:18,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:48:18,214 INFO L225 Difference]: With dead ends: 412 [2021-06-05 14:48:18,214 INFO L226 Difference]: Without dead ends: 375 [2021-06-05 14:48:18,214 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 3238.1ms TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:48:18,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-06-05 14:48:18,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 244. [2021-06-05 14:48:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 2.8641975308641974) internal successors, (696), 243 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 14:48:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 696 transitions. [2021-06-05 14:48:18,217 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 696 transitions. Word has length 20 [2021-06-05 14:48:18,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:48:18,217 INFO L482 AbstractCegarLoop]: Abstraction has 244 states and 696 transitions. [2021-06-05 14:48:18,217 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 14:48:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 696 transitions. [2021-06-05 14:48:18,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:48:18,218 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:48:18,218 INFO L521 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 14:48:18,420 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 206 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1090 [2021-06-05 14:48:18,421 INFO L430 AbstractCegarLoop]: === Iteration 397 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:48:18,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:48:18,421 INFO L82 PathProgramCache]: Analyzing trace with hash -225291252, now seen corresponding path program 5 times [2021-06-05 14:48:18,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:48:18,421 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532425307] [2021-06-05 14:48:18,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:48:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:48:18,771 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2021-06-05 14:48:18,854 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 14:48:18,854 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:48:18,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532425307] [2021-06-05 14:48:18,854 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532425307] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:48:18,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046350346] [2021-06-05 14:48:18,854 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 14:48:18,881 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:48:18,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:48:18,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:48:18,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:48:19,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 22 treesize of output 16 [2021-06-05 14:48:19,061 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:19,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 30 treesize of output 22 [2021-06-05 14:48:19,065 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:19,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:19,069 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:19,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:19,072 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:19,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 31 treesize of output 23 [2021-06-05 14:48:19,076 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:19,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 22 treesize of output 16 [2021-06-05 14:48:19,080 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:19,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:19,084 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:19,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:19,092 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:19,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:19,097 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:19,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:19,102 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:19,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 23 treesize of output 17 [2021-06-05 14:48:19,106 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:19,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 31 treesize of output 23 [2021-06-05 14:48:19,111 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:19,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 30 treesize of output 22 [2021-06-05 14:48:19,116 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:19,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:19,120 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:19,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 30 treesize of output 22 [2021-06-05 14:48:19,124 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:19,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:19,129 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:19,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:19,133 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:19,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 23 treesize of output 17 [2021-06-05 14:48:19,137 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:19,251 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2021-06-05 14:48:19,251 INFO L628 ElimStorePlain]: treesize reduction 103, result has 63.5 percent of original size [2021-06-05 14:48:19,252 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:48:19,252 INFO L247 ElimStorePlain]: Needed 19 recursive calls to eliminate 1 variables, input treesize:751, output treesize:179 [2021-06-05 14:48:19,598 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 14:48:19,598 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046350346] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:48:19,598 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:48:19,598 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:48:19,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964417844] [2021-06-05 14:48:19,598 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:48:19,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:48:19,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:48:19,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:48:19,598 INFO L87 Difference]: Start difference. First operand 244 states and 696 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 14:48:20,370 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 79 [2021-06-05 14:48:20,815 WARN L205 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 85 [2021-06-05 14:48:21,025 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2021-06-05 14:48:21,267 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 76 [2021-06-05 14:48:21,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:48:21,277 INFO L93 Difference]: Finished difference Result 377 states and 1054 transitions. [2021-06-05 14:48:21,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:48:21,277 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 14:48:21,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:48:21,278 INFO L225 Difference]: With dead ends: 377 [2021-06-05 14:48:21,278 INFO L226 Difference]: Without dead ends: 350 [2021-06-05 14:48:21,278 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2211.8ms TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:48:21,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2021-06-05 14:48:21,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 250. [2021-06-05 14:48:21,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 2.859437751004016) internal successors, (712), 249 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:48:21,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 712 transitions. [2021-06-05 14:48:21,281 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 712 transitions. Word has length 20 [2021-06-05 14:48:21,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:48:21,281 INFO L482 AbstractCegarLoop]: Abstraction has 250 states and 712 transitions. [2021-06-05 14:48:21,281 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 14:48:21,281 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 712 transitions. [2021-06-05 14:48:21,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:48:21,281 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:48:21,281 INFO L521 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 14:48:21,481 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 207 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1150 [2021-06-05 14:48:21,481 INFO L430 AbstractCegarLoop]: === Iteration 398 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:48:21,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:48:21,482 INFO L82 PathProgramCache]: Analyzing trace with hash 253993424, now seen corresponding path program 6 times [2021-06-05 14:48:21,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:48:21,482 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826671622] [2021-06-05 14:48:21,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:48:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:48:21,915 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 14:48:21,915 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:48:21,915 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826671622] [2021-06-05 14:48:21,915 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826671622] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:48:21,915 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334749688] [2021-06-05 14:48:21,915 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 14:48:21,942 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:48:21,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:48:21,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:48:21,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:48:22,857 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:22,858 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:22,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 29 treesize of output 21 [2021-06-05 14:48:22,859 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:22,864 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:22,864 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:22,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 14:48:22,866 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:22,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:22,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:22,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 14:48:22,872 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:22,877 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:22,878 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:22,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:22,879 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:22,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:22,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:22,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 22 treesize of output 16 [2021-06-05 14:48:22,886 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:22,891 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:22,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:22,892 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:23,291 WARN L205 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2021-06-05 14:48:23,291 INFO L628 ElimStorePlain]: treesize reduction 579, result has 46.4 percent of original size [2021-06-05 14:48:23,296 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:23,296 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:23,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 23 treesize of output 17 [2021-06-05 14:48:23,297 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:23,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:23,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:23,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 14:48:23,310 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:23,314 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:23,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 31 treesize of output 23 [2021-06-05 14:48:23,315 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:23,630 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 82 [2021-06-05 14:48:23,631 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.8 percent of original size [2021-06-05 14:48:23,635 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:23,635 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:23,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:23,637 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:23,641 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:23,641 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:23,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:23,643 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:23,647 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:23,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:23,648 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:23,802 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-06-05 14:48:23,802 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:23,807 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:23,807 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:23,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 15 treesize of output 11 [2021-06-05 14:48:23,808 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:23,814 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:23,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:23,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 23 treesize of output 17 [2021-06-05 14:48:23,816 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:23,819 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:23,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 15 treesize of output 11 [2021-06-05 14:48:23,821 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:23,970 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-06-05 14:48:23,971 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:23,992 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 14:48:23,992 INFO L247 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:1249, output treesize:397 [2021-06-05 14:48:24,174 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2021-06-05 14:48:24,513 INFO L446 ElimStorePlain]: Different costs {0=[get_6, v_prenex_141, v_prenex_143, v_prenex_135, v_prenex_137, v_prenex_139], 1=[v_prenex_140, v_prenex_142, v_prenex_144, get_0, v_prenex_136, v_prenex_138]} [2021-06-05 14:48:24,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 22 treesize of output 16 [2021-06-05 14:48:24,522 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:24,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 29 treesize of output 21 [2021-06-05 14:48:24,531 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:24,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 23 treesize of output 17 [2021-06-05 14:48:24,539 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:24,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 22 treesize of output 16 [2021-06-05 14:48:24,547 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:24,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 23 treesize of output 17 [2021-06-05 14:48:24,555 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:24,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 30 treesize of output 22 [2021-06-05 14:48:24,563 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:25,023 WARN L205 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 102 [2021-06-05 14:48:25,023 INFO L628 ElimStorePlain]: treesize reduction 1573, result has 19.5 percent of original size [2021-06-05 14:48:25,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 7 treesize of output 5 [2021-06-05 14:48:25,029 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:25,160 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-06-05 14:48:25,160 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:25,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:25,165 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:25,292 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-06-05 14:48:25,292 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:25,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 7 treesize of output 5 [2021-06-05 14:48:25,297 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:25,422 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-06-05 14:48:25,422 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:25,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 14:48:25,427 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:25,549 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-06-05 14:48:25,549 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:25,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 16 treesize of output 12 [2021-06-05 14:48:25,553 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:25,674 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-06-05 14:48:25,675 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:25,675 INFO L518 ElimStorePlain]: Eliminatee v_prenex_140 vanished before elimination [2021-06-05 14:48:25,675 INFO L518 ElimStorePlain]: Eliminatee v_prenex_142 vanished before elimination [2021-06-05 14:48:25,675 INFO L518 ElimStorePlain]: Eliminatee v_prenex_144 vanished before elimination [2021-06-05 14:48:25,675 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 14:48:25,675 INFO L518 ElimStorePlain]: Eliminatee v_prenex_136 vanished before elimination [2021-06-05 14:48:25,675 INFO L518 ElimStorePlain]: Eliminatee v_prenex_138 vanished before elimination [2021-06-05 14:48:25,679 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 16 xjuncts. [2021-06-05 14:48:25,680 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 18 variables, input treesize:2135, output treesize:283 [2021-06-05 14:48:25,810 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2021-06-05 14:48:26,010 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 14:48:26,010 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334749688] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:48:26,010 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:48:26,010 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:48:26,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290780570] [2021-06-05 14:48:26,010 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:48:26,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:48:26,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:48:26,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:48:26,011 INFO L87 Difference]: Start difference. First operand 250 states and 712 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 14:48:26,295 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2021-06-05 14:48:26,597 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 90 [2021-06-05 14:48:26,977 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2021-06-05 14:48:27,715 WARN L205 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 195 [2021-06-05 14:48:27,882 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2021-06-05 14:48:28,390 WARN L205 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 117 [2021-06-05 14:48:28,550 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2021-06-05 14:48:29,105 WARN L205 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 125 [2021-06-05 14:48:29,388 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2021-06-05 14:48:30,047 WARN L205 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 134 [2021-06-05 14:48:30,359 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 89 [2021-06-05 14:48:30,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:48:30,392 INFO L93 Difference]: Finished difference Result 498 states and 1324 transitions. [2021-06-05 14:48:30,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 14:48:30,393 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 14:48:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:48:30,393 INFO L225 Difference]: With dead ends: 498 [2021-06-05 14:48:30,393 INFO L226 Difference]: Without dead ends: 462 [2021-06-05 14:48:30,394 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 5038.7ms TimeCoverageRelationStatistics Valid=195, Invalid=927, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 14:48:30,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2021-06-05 14:48:30,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 267. [2021-06-05 14:48:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 2.8796992481203008) internal successors, (766), 266 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:48:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 766 transitions. [2021-06-05 14:48:30,397 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 766 transitions. Word has length 20 [2021-06-05 14:48:30,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:48:30,397 INFO L482 AbstractCegarLoop]: Abstraction has 267 states and 766 transitions. [2021-06-05 14:48:30,397 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 14:48:30,397 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 766 transitions. [2021-06-05 14:48:30,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:48:30,397 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:48:30,397 INFO L521 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 14:48:30,597 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1175,208 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:48:30,598 INFO L430 AbstractCegarLoop]: === Iteration 399 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:48:30,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:48:30,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1444726964, now seen corresponding path program 7 times [2021-06-05 14:48:30,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:48:30,598 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113315104] [2021-06-05 14:48:30,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:48:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:48:31,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 14:48:31,072 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:48:31,072 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113315104] [2021-06-05 14:48:31,072 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113315104] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:48:31,072 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136986540] [2021-06-05 14:48:31,073 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 14:48:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:48:31,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:48:31,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:48:31,490 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:31,490 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:31,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 31 treesize of output 23 [2021-06-05 14:48:31,492 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:31,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:31,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:31,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 14:48:31,498 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:31,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:31,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 38 treesize of output 28 [2021-06-05 14:48:31,505 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:31,763 WARN L205 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 98 [2021-06-05 14:48:31,763 INFO L628 ElimStorePlain]: treesize reduction 116, result has 74.7 percent of original size [2021-06-05 14:48:31,768 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:31,768 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:31,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:31,769 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:31,774 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:31,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:31,775 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:31,893 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-06-05 14:48:31,894 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:31,898 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:31,898 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:31,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:31,900 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:31,904 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:31,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:31,907 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:32,019 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 14:48:32,019 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:32,024 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:32,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:32,026 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:32,138 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-06-05 14:48:32,138 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:32,143 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:32,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 14:48:32,144 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:32,257 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-06-05 14:48:32,258 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:32,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:32,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 14:48:32,263 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:32,368 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-06-05 14:48:32,368 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:32,374 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 14:48:32,374 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:565, output treesize:268 [2021-06-05 14:48:32,572 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 96 [2021-06-05 14:48:33,245 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_161, v_prenex_163, get_6, v_prenex_165, v_prenex_167, v_prenex_169, v_prenex_159], 1=[v_prenex_170, v_prenex_160, v_prenex_162, v_prenex_164, v_prenex_166, v_prenex_168, get_0]} [2021-06-05 14:48:33,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 31 treesize of output 23 [2021-06-05 14:48:33,255 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:33,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:33,265 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:33,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:33,274 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:33,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:33,283 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:33,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 32 treesize of output 24 [2021-06-05 14:48:33,292 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:33,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:33,301 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:33,807 WARN L205 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 104 [2021-06-05 14:48:33,808 INFO L628 ElimStorePlain]: treesize reduction 1750, result has 17.2 percent of original size [2021-06-05 14:48:33,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:33,813 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:33,941 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-06-05 14:48:33,941 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:33,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 7 treesize of output 5 [2021-06-05 14:48:33,946 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:34,073 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-06-05 14:48:34,074 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:34,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:34,079 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:34,203 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 14:48:34,203 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:34,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:34,208 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:34,328 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-06-05 14:48:34,329 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:34,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 16 treesize of output 12 [2021-06-05 14:48:34,334 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:34,450 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-06-05 14:48:34,450 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:34,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:34,455 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:34,569 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-06-05 14:48:34,570 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:34,570 INFO L518 ElimStorePlain]: Eliminatee v_prenex_170 vanished before elimination [2021-06-05 14:48:34,570 INFO L518 ElimStorePlain]: Eliminatee v_prenex_160 vanished before elimination [2021-06-05 14:48:34,570 INFO L518 ElimStorePlain]: Eliminatee v_prenex_162 vanished before elimination [2021-06-05 14:48:34,570 INFO L518 ElimStorePlain]: Eliminatee v_prenex_164 vanished before elimination [2021-06-05 14:48:34,570 INFO L518 ElimStorePlain]: Eliminatee v_prenex_166 vanished before elimination [2021-06-05 14:48:34,570 INFO L518 ElimStorePlain]: Eliminatee v_prenex_168 vanished before elimination [2021-06-05 14:48:34,570 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 14:48:34,573 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 14:48:34,573 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 21 variables, input treesize:2293, output treesize:253 [2021-06-05 14:48:34,934 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2021-06-05 14:48:35,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 14:48:35,014 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136986540] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:48:35,014 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:48:35,014 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:48:35,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584302509] [2021-06-05 14:48:35,014 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:48:35,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:48:35,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:48:35,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:48:35,015 INFO L87 Difference]: Start difference. First operand 267 states and 766 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 14:48:35,666 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2021-06-05 14:48:36,135 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 137 [2021-06-05 14:48:36,290 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2021-06-05 14:48:36,715 WARN L205 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 90 [2021-06-05 14:48:37,393 WARN L205 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 103 [2021-06-05 14:48:37,550 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2021-06-05 14:48:38,183 WARN L205 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 110 [2021-06-05 14:48:38,381 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2021-06-05 14:48:38,921 WARN L205 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 102 [2021-06-05 14:48:38,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:48:38,922 INFO L93 Difference]: Finished difference Result 458 states and 1250 transitions. [2021-06-05 14:48:38,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 14:48:38,922 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 14:48:38,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:48:38,923 INFO L225 Difference]: With dead ends: 458 [2021-06-05 14:48:38,923 INFO L226 Difference]: Without dead ends: 428 [2021-06-05 14:48:38,923 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 4595.3ms TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 14:48:38,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-06-05 14:48:38,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 261. [2021-06-05 14:48:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 2.8846153846153846) internal successors, (750), 260 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 14:48:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 750 transitions. [2021-06-05 14:48:38,926 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 750 transitions. Word has length 20 [2021-06-05 14:48:38,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:48:38,926 INFO L482 AbstractCegarLoop]: Abstraction has 261 states and 750 transitions. [2021-06-05 14:48:38,926 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 14:48:38,926 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 750 transitions. [2021-06-05 14:48:38,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:48:38,927 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:48:38,927 INFO L521 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 14:48:39,137 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 209 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1425 [2021-06-05 14:48:39,137 INFO L430 AbstractCegarLoop]: === Iteration 400 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:48:39,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:48:39,137 INFO L82 PathProgramCache]: Analyzing trace with hash 789223226, now seen corresponding path program 8 times [2021-06-05 14:48:39,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:48:39,137 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057250538] [2021-06-05 14:48:39,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:48:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:48:39,533 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 14:48:39,533 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:48:39,533 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057250538] [2021-06-05 14:48:39,533 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057250538] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:48:39,533 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48326115] [2021-06-05 14:48:39,533 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 14:48:39,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:48:39,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:48:39,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:48:39,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:48:39,919 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:39,919 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:39,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:39,920 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:39,925 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:39,926 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:39,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 31 treesize of output 23 [2021-06-05 14:48:39,927 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:39,931 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:39,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:39,932 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:40,151 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2021-06-05 14:48:40,152 INFO L628 ElimStorePlain]: treesize reduction 110, result has 74.1 percent of original size [2021-06-05 14:48:40,156 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:40,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:40,159 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:40,265 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 14:48:40,266 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:40,272 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:40,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 23 treesize of output 17 [2021-06-05 14:48:40,274 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:40,380 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-06-05 14:48:40,380 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:40,385 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:40,386 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:40,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:40,387 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:40,391 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:40,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:40,391 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:40,486 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:40,490 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:40,490 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:40,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:40,493 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:40,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:40,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:40,500 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:40,592 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:40,596 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:40,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 15 treesize of output 11 [2021-06-05 14:48:40,598 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:40,692 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:40,697 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 14:48:40,698 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:529, output treesize:241 [2021-06-05 14:48:40,884 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 88 [2021-06-05 14:48:41,176 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2021-06-05 14:48:41,328 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 14:48:41,328 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48326115] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:48:41,328 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:48:41,328 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:48:41,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159505467] [2021-06-05 14:48:41,328 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:48:41,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:48:41,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:48:41,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:48:41,329 INFO L87 Difference]: Start difference. First operand 261 states and 750 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 14:48:41,746 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2021-06-05 14:48:41,990 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 67 [2021-06-05 14:48:42,447 WARN L205 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 129 [2021-06-05 14:48:42,864 WARN L205 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 86 [2021-06-05 14:48:43,358 WARN L205 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 94 [2021-06-05 14:48:43,682 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 89 [2021-06-05 14:48:44,229 WARN L205 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 103 [2021-06-05 14:48:44,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:48:44,272 INFO L93 Difference]: Finished difference Result 450 states and 1228 transitions. [2021-06-05 14:48:44,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:48:44,273 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 14:48:44,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:48:44,273 INFO L225 Difference]: With dead ends: 450 [2021-06-05 14:48:44,273 INFO L226 Difference]: Without dead ends: 398 [2021-06-05 14:48:44,274 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 3576.6ms TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:48:44,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-06-05 14:48:44,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 281. [2021-06-05 14:48:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 2.8321428571428573) internal successors, (793), 280 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 14:48:44,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 793 transitions. [2021-06-05 14:48:44,277 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 793 transitions. Word has length 20 [2021-06-05 14:48:44,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:48:44,277 INFO L482 AbstractCegarLoop]: Abstraction has 281 states and 793 transitions. [2021-06-05 14:48:44,277 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 14:48:44,277 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 793 transitions. [2021-06-05 14:48:44,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:48:44,277 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:48:44,277 INFO L521 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 14:48:44,477 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 210 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1596 [2021-06-05 14:48:44,478 INFO L430 AbstractCegarLoop]: === Iteration 401 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:48:44,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:48:44,478 INFO L82 PathProgramCache]: Analyzing trace with hash -909497162, now seen corresponding path program 9 times [2021-06-05 14:48:44,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:48:44,478 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423890516] [2021-06-05 14:48:44,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:48:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:48:44,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 14:48:44,779 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:48:44,779 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423890516] [2021-06-05 14:48:44,779 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423890516] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:48:44,779 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636314338] [2021-06-05 14:48:44,779 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 14:48:44,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:48:44,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:48:44,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 14:48:44,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:48:45,537 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:45,537 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:45,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 23 treesize of output 17 [2021-06-05 14:48:45,538 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:45,545 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:45,545 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:45,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 30 treesize of output 22 [2021-06-05 14:48:45,546 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:45,552 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:45,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:45,553 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:45,993 WARN L205 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 136 [2021-06-05 14:48:45,994 INFO L628 ElimStorePlain]: treesize reduction 201, result has 73.1 percent of original size [2021-06-05 14:48:46,000 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:46,000 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:46,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:46,001 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:46,007 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:46,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:46,008 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:46,219 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2021-06-05 14:48:46,219 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:46,225 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:46,225 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:46,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:46,226 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:46,231 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:46,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:46,232 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:46,434 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2021-06-05 14:48:46,434 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:46,440 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:46,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 14:48:46,442 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:46,639 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-06-05 14:48:46,639 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:46,645 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:46,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:46,647 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:46,840 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-06-05 14:48:46,841 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:46,847 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:46,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 15 treesize of output 11 [2021-06-05 14:48:46,848 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:47,042 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-06-05 14:48:47,043 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:47,048 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:47,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 15 treesize of output 11 [2021-06-05 14:48:47,049 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:47,235 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-06-05 14:48:47,236 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:47,240 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:47,241 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:47,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 31 treesize of output 23 [2021-06-05 14:48:47,243 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:47,247 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:47,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:47,248 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:47,421 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-05 14:48:47,421 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:47,431 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 14:48:47,431 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 16 variables, input treesize:833, output treesize:435 [2021-06-05 14:48:47,761 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 139 [2021-06-05 14:48:48,128 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_228, get_6, v_prenex_230, v_prenex_220, v_prenex_232, v_prenex_222, v_prenex_234, v_prenex_224, v_prenex_236, v_prenex_226], 1=[get_3, v_prenex_229, v_prenex_219, v_prenex_231, v_prenex_221, v_prenex_233, v_prenex_223, v_prenex_235, v_prenex_225, v_prenex_227]} [2021-06-05 14:48:48,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:48,143 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:48,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:48,159 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:48,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:48,173 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:48,188 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:48:48,189 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:48,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:48,201 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:48,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 30 treesize of output 22 [2021-06-05 14:48:48,213 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:49,051 WARN L205 SmtUtils]: Spent 837.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 148 [2021-06-05 14:48:49,052 INFO L628 ElimStorePlain]: treesize reduction 2812, result has 14.9 percent of original size [2021-06-05 14:48:49,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:49,059 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:49,233 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2021-06-05 14:48:49,233 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:49,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 14:48:49,241 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:49,414 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2021-06-05 14:48:49,414 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:49,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:49,421 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:49,600 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2021-06-05 14:48:49,600 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:49,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 14:48:49,607 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:49,774 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-06-05 14:48:49,774 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:49,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:49,780 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:49,948 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2021-06-05 14:48:49,948 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:49,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 9 treesize of output 7 [2021-06-05 14:48:49,955 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:50,116 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-06-05 14:48:50,117 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:50,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:50,124 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:50,285 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-05 14:48:50,285 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:50,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:50,291 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:50,449 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-05 14:48:50,449 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:50,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 9 treesize of output 7 [2021-06-05 14:48:50,455 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:50,610 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-06-05 14:48:50,611 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:50,611 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 14:48:50,611 INFO L518 ElimStorePlain]: Eliminatee v_prenex_229 vanished before elimination [2021-06-05 14:48:50,611 INFO L518 ElimStorePlain]: Eliminatee v_prenex_219 vanished before elimination [2021-06-05 14:48:50,611 INFO L518 ElimStorePlain]: Eliminatee v_prenex_231 vanished before elimination [2021-06-05 14:48:50,611 INFO L518 ElimStorePlain]: Eliminatee v_prenex_221 vanished before elimination [2021-06-05 14:48:50,611 INFO L518 ElimStorePlain]: Eliminatee v_prenex_233 vanished before elimination [2021-06-05 14:48:50,611 INFO L518 ElimStorePlain]: Eliminatee v_prenex_223 vanished before elimination [2021-06-05 14:48:50,611 INFO L518 ElimStorePlain]: Eliminatee v_prenex_235 vanished before elimination [2021-06-05 14:48:50,611 INFO L518 ElimStorePlain]: Eliminatee v_prenex_225 vanished before elimination [2021-06-05 14:48:50,611 INFO L518 ElimStorePlain]: Eliminatee v_prenex_227 vanished before elimination [2021-06-05 14:48:50,617 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 14:48:50,617 INFO L247 ElimStorePlain]: Needed 16 recursive calls to eliminate 30 variables, input treesize:3421, output treesize:346 [2021-06-05 14:48:50,884 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2021-06-05 14:48:51,108 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2021-06-05 14:48:51,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 14:48:51,226 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636314338] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:48:51,226 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:48:51,226 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:48:51,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704365120] [2021-06-05 14:48:51,226 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:48:51,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:48:51,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:48:51,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:48:51,227 INFO L87 Difference]: Start difference. First operand 281 states and 793 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 14:48:51,578 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 82 [2021-06-05 14:48:51,880 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2021-06-05 14:48:52,492 WARN L205 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 179 [2021-06-05 14:48:53,025 WARN L205 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 103 [2021-06-05 14:48:53,677 WARN L205 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 112 [2021-06-05 14:48:53,865 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2021-06-05 14:48:54,482 WARN L205 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 119 [2021-06-05 14:48:54,699 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2021-06-05 14:48:54,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:48:54,724 INFO L93 Difference]: Finished difference Result 514 states and 1358 transitions. [2021-06-05 14:48:54,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 14:48:54,725 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 14:48:54,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:48:54,725 INFO L225 Difference]: With dead ends: 514 [2021-06-05 14:48:54,725 INFO L226 Difference]: Without dead ends: 474 [2021-06-05 14:48:54,725 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 4599.6ms TimeCoverageRelationStatistics Valid=193, Invalid=863, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 14:48:54,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-06-05 14:48:54,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 284. [2021-06-05 14:48:54,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 2.862190812720848) internal successors, (810), 283 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:48:54,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 810 transitions. [2021-06-05 14:48:54,729 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 810 transitions. Word has length 20 [2021-06-05 14:48:54,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:48:54,729 INFO L482 AbstractCegarLoop]: Abstraction has 284 states and 810 transitions. [2021-06-05 14:48:54,729 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 14:48:54,729 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 810 transitions. [2021-06-05 14:48:54,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:48:54,729 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:48:54,729 INFO L521 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 14:48:54,930 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1666,211 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:48:54,930 INFO L430 AbstractCegarLoop]: === Iteration 402 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:48:54,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:48:54,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1082744854, now seen corresponding path program 10 times [2021-06-05 14:48:54,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:48:54,930 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237595339] [2021-06-05 14:48:54,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:48:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:48:55,180 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 14:48:55,180 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:48:55,180 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237595339] [2021-06-05 14:48:55,180 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237595339] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:48:55,180 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512620927] [2021-06-05 14:48:55,181 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 14:48:55,207 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:48:55,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:48:55,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:48:55,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:48:55,552 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:55,552 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:55,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:55,553 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:55,558 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:55,558 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:55,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:55,559 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:55,564 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:55,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:55,565 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:55,811 WARN L205 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2021-06-05 14:48:55,811 INFO L628 ElimStorePlain]: treesize reduction 156, result has 68.8 percent of original size [2021-06-05 14:48:55,816 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:55,816 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:55,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:55,817 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:55,821 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:55,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:55,824 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:55,925 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 14:48:55,926 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:55,930 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:55,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 14:48:55,931 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:56,031 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-06-05 14:48:56,031 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:56,035 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:56,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 23 treesize of output 17 [2021-06-05 14:48:56,036 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:56,135 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:56,139 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:56,139 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:56,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:56,140 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:56,144 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:56,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 14:48:56,145 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:56,236 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:56,240 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:48:56,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:48:56,241 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:56,335 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:48:56,341 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 14:48:56,341 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:529, output treesize:241 [2021-06-05 14:48:56,528 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 88 [2021-06-05 14:48:56,699 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 69 [2021-06-05 14:48:56,989 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 14:48:56,989 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512620927] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:48:56,989 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:48:56,989 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:48:56,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14879870] [2021-06-05 14:48:56,989 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:48:56,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:48:56,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:48:56,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:48:56,989 INFO L87 Difference]: Start difference. First operand 284 states and 810 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 14:48:57,212 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2021-06-05 14:48:57,424 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2021-06-05 14:48:57,680 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2021-06-05 14:48:58,112 WARN L205 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 136 [2021-06-05 14:48:58,639 WARN L205 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 143 [2021-06-05 14:48:58,883 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2021-06-05 14:48:59,168 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 101 [2021-06-05 14:48:59,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:48:59,180 INFO L93 Difference]: Finished difference Result 399 states and 1123 transitions. [2021-06-05 14:48:59,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:48:59,180 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 14:48:59,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:48:59,181 INFO L225 Difference]: With dead ends: 399 [2021-06-05 14:48:59,181 INFO L226 Difference]: Without dead ends: 367 [2021-06-05 14:48:59,181 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 2776.1ms TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:48:59,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-06-05 14:48:59,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 267. [2021-06-05 14:48:59,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 2.9022556390977443) internal successors, (772), 266 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 14:48:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 772 transitions. [2021-06-05 14:48:59,184 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 772 transitions. Word has length 20 [2021-06-05 14:48:59,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:48:59,184 INFO L482 AbstractCegarLoop]: Abstraction has 267 states and 772 transitions. [2021-06-05 14:48:59,184 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 14:48:59,184 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 772 transitions. [2021-06-05 14:48:59,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:48:59,184 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:48:59,184 INFO L521 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 14:48:59,384 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 212 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1819 [2021-06-05 14:48:59,385 INFO L430 AbstractCegarLoop]: === Iteration 403 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:48:59,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:48:59,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1695383606, now seen corresponding path program 11 times [2021-06-05 14:48:59,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:48:59,385 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213115441] [2021-06-05 14:48:59,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:48:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:48:59,745 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 14:48:59,745 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:48:59,745 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213115441] [2021-06-05 14:48:59,745 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213115441] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:48:59,745 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6309724] [2021-06-05 14:48:59,746 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 14:48:59,773 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:48:59,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:48:59,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:48:59,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:48:59,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 31 treesize of output 23 [2021-06-05 14:48:59,934 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:59,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 14:48:59,938 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:59,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 38 treesize of output 28 [2021-06-05 14:48:59,942 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:59,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 29 treesize of output 21 [2021-06-05 14:48:59,945 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:59,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 38 treesize of output 28 [2021-06-05 14:48:59,949 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:59,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 14:48:59,952 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:59,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:59,956 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:59,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:48:59,959 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:59,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 23 treesize of output 17 [2021-06-05 14:48:59,963 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:59,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 31 treesize of output 23 [2021-06-05 14:48:59,966 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:59,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 22 treesize of output 16 [2021-06-05 14:48:59,970 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:59,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 30 treesize of output 22 [2021-06-05 14:48:59,973 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:59,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 22 treesize of output 16 [2021-06-05 14:48:59,977 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:59,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 37 treesize of output 27 [2021-06-05 14:48:59,980 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:59,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 14:48:59,983 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:59,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 14:48:59,986 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:59,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 14:48:59,990 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:48:59,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 30 treesize of output 22 [2021-06-05 14:48:59,993 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:00,083 INFO L628 ElimStorePlain]: treesize reduction 91, result has 62.6 percent of original size [2021-06-05 14:49:00,087 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:49:00,087 INFO L247 ElimStorePlain]: Needed 19 recursive calls to eliminate 1 variables, input treesize:697, output treesize:152 [2021-06-05 14:49:00,515 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-06-05 14:49:00,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 14:49:00,526 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6309724] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:49:00,526 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:49:00,526 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:49:00,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643041482] [2021-06-05 14:49:00,526 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:49:00,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:49:00,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:49:00,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:49:00,527 INFO L87 Difference]: Start difference. First operand 267 states and 772 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 14:49:01,117 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 72 [2021-06-05 14:49:01,407 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 81 [2021-06-05 14:49:01,708 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 95 [2021-06-05 14:49:02,075 WARN L205 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 104 [2021-06-05 14:49:02,479 WARN L205 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 107 [2021-06-05 14:49:02,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:49:02,494 INFO L93 Difference]: Finished difference Result 498 states and 1377 transitions. [2021-06-05 14:49:02,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:49:02,495 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 14:49:02,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:49:02,495 INFO L225 Difference]: With dead ends: 498 [2021-06-05 14:49:02,495 INFO L226 Difference]: Without dead ends: 465 [2021-06-05 14:49:02,495 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 2509.0ms TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:49:02,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-06-05 14:49:02,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 273. [2021-06-05 14:49:02,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 2.8970588235294117) internal successors, (788), 272 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 14:49:02,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 788 transitions. [2021-06-05 14:49:02,499 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 788 transitions. Word has length 20 [2021-06-05 14:49:02,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:49:02,499 INFO L482 AbstractCegarLoop]: Abstraction has 273 states and 788 transitions. [2021-06-05 14:49:02,499 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 14:49:02,499 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 788 transitions. [2021-06-05 14:49:02,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:49:02,499 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:49:02,499 INFO L521 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 14:49:02,699 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1879,213 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:49:02,700 INFO L430 AbstractCegarLoop]: === Iteration 404 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:49:02,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:49:02,700 INFO L82 PathProgramCache]: Analyzing trace with hash 896343602, now seen corresponding path program 12 times [2021-06-05 14:49:02,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:49:02,700 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267011787] [2021-06-05 14:49:02,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:49:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:49:02,890 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 14:49:02,891 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:49:02,891 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267011787] [2021-06-05 14:49:02,891 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267011787] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:49:02,891 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794833650] [2021-06-05 14:49:02,891 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 14:49:02,917 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:49:02,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:49:02,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 14:49:02,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:49:03,638 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:03,639 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:03,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:03,640 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:03,645 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:03,645 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:03,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:03,646 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:03,652 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:03,652 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:03,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:03,653 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:03,658 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:03,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:03,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 30 treesize of output 22 [2021-06-05 14:49:03,661 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:03,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:03,667 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:03,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 23 treesize of output 17 [2021-06-05 14:49:03,668 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:03,673 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:03,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:03,674 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:04,085 WARN L205 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2021-06-05 14:49:04,086 INFO L628 ElimStorePlain]: treesize reduction 582, result has 46.5 percent of original size [2021-06-05 14:49:04,090 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:04,090 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:04,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 14:49:04,092 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:04,095 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:04,096 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:04,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:04,097 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:04,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:04,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:04,102 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:04,427 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 85 [2021-06-05 14:49:04,428 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.8 percent of original size [2021-06-05 14:49:04,432 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:04,433 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:04,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:04,434 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:04,438 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:04,438 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:04,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 30 treesize of output 22 [2021-06-05 14:49:04,439 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:04,443 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:04,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 23 treesize of output 17 [2021-06-05 14:49:04,444 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:04,737 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 77 [2021-06-05 14:49:04,737 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.8 percent of original size [2021-06-05 14:49:04,742 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:04,742 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:04,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 22 treesize of output 16 [2021-06-05 14:49:04,743 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:04,747 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:04,747 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:04,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:04,748 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:04,752 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:04,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:04,753 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:04,895 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-06-05 14:49:04,895 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:04,904 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 14:49:04,907 INFO L247 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:1201, output treesize:372 [2021-06-05 14:49:05,061 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2021-06-05 14:49:05,289 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2021-06-05 14:49:05,656 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 130 [2021-06-05 14:49:06,730 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_291, v_prenex_281, v_prenex_293, v_prenex_283, get_6, v_prenex_295, v_prenex_285, v_prenex_297, v_prenex_287, v_prenex_299, v_prenex_289, v_prenex_301, v_prenex_279, v_prenex_312, v_prenex_303, v_prenex_305], 1=[v_prenex_290, v_prenex_280, v_prenex_292, v_prenex_282, v_prenex_294, v_prenex_284, v_prenex_296, v_prenex_286, v_prenex_298, v_prenex_288, v_prenex_300, get_0, v_prenex_302, v_prenex_313, v_prenex_304, v_prenex_306]} [2021-06-05 14:49:06,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 23 treesize of output 17 [2021-06-05 14:49:06,750 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:06,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:06,765 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:06,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:06,779 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:07,333 WARN L205 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 311 DAG size of output: 130 [2021-06-05 14:49:07,334 INFO L628 ElimStorePlain]: treesize reduction 1348, result has 24.9 percent of original size [2021-06-05 14:49:07,334 INFO L518 ElimStorePlain]: Eliminatee v_prenex_281 vanished before elimination [2021-06-05 14:49:07,334 INFO L518 ElimStorePlain]: Eliminatee v_prenex_293 vanished before elimination [2021-06-05 14:49:07,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:07,341 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:07,500 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-06-05 14:49:07,508 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:07,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:07,516 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:07,693 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-06-05 14:49:07,694 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:07,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 7 treesize of output 5 [2021-06-05 14:49:07,700 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:07,864 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-06-05 14:49:07,864 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:07,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 16 treesize of output 12 [2021-06-05 14:49:07,870 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:08,031 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-06-05 14:49:08,031 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:08,031 INFO L518 ElimStorePlain]: Eliminatee v_prenex_297 vanished before elimination [2021-06-05 14:49:08,031 INFO L518 ElimStorePlain]: Eliminatee v_prenex_287 vanished before elimination [2021-06-05 14:49:08,031 INFO L518 ElimStorePlain]: Eliminatee v_prenex_299 vanished before elimination [2021-06-05 14:49:08,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 7 treesize of output 5 [2021-06-05 14:49:08,037 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:08,185 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-05 14:49:08,185 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:08,185 INFO L518 ElimStorePlain]: Eliminatee v_prenex_301 vanished before elimination [2021-06-05 14:49:08,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 7 treesize of output 5 [2021-06-05 14:49:08,191 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:08,339 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-06-05 14:49:08,340 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:08,340 INFO L518 ElimStorePlain]: Eliminatee v_prenex_312 vanished before elimination [2021-06-05 14:49:08,340 INFO L518 ElimStorePlain]: Eliminatee v_prenex_303 vanished before elimination [2021-06-05 14:49:08,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 7 treesize of output 5 [2021-06-05 14:49:08,346 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:08,496 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 14:49:08,496 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:08,496 INFO L518 ElimStorePlain]: Eliminatee v_prenex_290 vanished before elimination [2021-06-05 14:49:08,496 INFO L518 ElimStorePlain]: Eliminatee v_prenex_280 vanished before elimination [2021-06-05 14:49:08,496 INFO L518 ElimStorePlain]: Eliminatee v_prenex_292 vanished before elimination [2021-06-05 14:49:08,497 INFO L518 ElimStorePlain]: Eliminatee v_prenex_282 vanished before elimination [2021-06-05 14:49:08,497 INFO L518 ElimStorePlain]: Eliminatee v_prenex_294 vanished before elimination [2021-06-05 14:49:08,497 INFO L518 ElimStorePlain]: Eliminatee v_prenex_284 vanished before elimination [2021-06-05 14:49:08,497 INFO L518 ElimStorePlain]: Eliminatee v_prenex_296 vanished before elimination [2021-06-05 14:49:08,497 INFO L518 ElimStorePlain]: Eliminatee v_prenex_286 vanished before elimination [2021-06-05 14:49:08,497 INFO L518 ElimStorePlain]: Eliminatee v_prenex_298 vanished before elimination [2021-06-05 14:49:08,497 INFO L518 ElimStorePlain]: Eliminatee v_prenex_288 vanished before elimination [2021-06-05 14:49:08,497 INFO L518 ElimStorePlain]: Eliminatee v_prenex_300 vanished before elimination [2021-06-05 14:49:08,497 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 14:49:08,497 INFO L518 ElimStorePlain]: Eliminatee v_prenex_302 vanished before elimination [2021-06-05 14:49:08,497 INFO L518 ElimStorePlain]: Eliminatee v_prenex_313 vanished before elimination [2021-06-05 14:49:08,497 INFO L518 ElimStorePlain]: Eliminatee v_prenex_304 vanished before elimination [2021-06-05 14:49:08,497 INFO L518 ElimStorePlain]: Eliminatee v_prenex_306 vanished before elimination [2021-06-05 14:49:08,503 INFO L550 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 32 dim-1 vars, End of recursive call: and 15 xjuncts. [2021-06-05 14:49:08,504 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 48 variables, input treesize:1882, output treesize:321 [2021-06-05 14:49:08,754 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2021-06-05 14:49:08,949 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 14:49:08,950 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794833650] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:49:08,950 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:49:08,950 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:49:08,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958356646] [2021-06-05 14:49:08,950 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:49:08,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:49:08,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:49:08,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:49:08,950 INFO L87 Difference]: Start difference. First operand 273 states and 788 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 14:49:09,336 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2021-06-05 14:49:09,864 WARN L205 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 183 [2021-06-05 14:49:10,506 WARN L205 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2021-06-05 14:49:10,668 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2021-06-05 14:49:11,883 WARN L205 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 241 DAG size of output: 226 [2021-06-05 14:49:12,094 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2021-06-05 14:49:13,056 WARN L205 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 208 [2021-06-05 14:49:13,197 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2021-06-05 14:49:13,938 WARN L205 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 222 [2021-06-05 14:49:14,088 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 14:49:14,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:49:14,111 INFO L93 Difference]: Finished difference Result 605 states and 1638 transitions. [2021-06-05 14:49:14,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 14:49:14,111 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 14:49:14,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:49:14,112 INFO L225 Difference]: With dead ends: 605 [2021-06-05 14:49:14,112 INFO L226 Difference]: Without dead ends: 563 [2021-06-05 14:49:14,112 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 6147.2ms TimeCoverageRelationStatistics Valid=197, Invalid=859, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 14:49:14,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-06-05 14:49:14,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 291. [2021-06-05 14:49:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 2.893103448275862) internal successors, (839), 290 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 14:49:14,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 839 transitions. [2021-06-05 14:49:14,116 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 839 transitions. Word has length 20 [2021-06-05 14:49:14,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:49:14,116 INFO L482 AbstractCegarLoop]: Abstraction has 291 states and 839 transitions. [2021-06-05 14:49:14,116 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 14:49:14,116 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 839 transitions. [2021-06-05 14:49:14,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:49:14,116 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:49:14,116 INFO L521 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 14:49:14,317 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1900,214 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:49:14,317 INFO L430 AbstractCegarLoop]: === Iteration 405 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:49:14,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:49:14,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1375628278, now seen corresponding path program 13 times [2021-06-05 14:49:14,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:49:14,317 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586517736] [2021-06-05 14:49:14,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:49:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:49:14,506 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 14:49:14,506 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:49:14,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586517736] [2021-06-05 14:49:14,507 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586517736] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:49:14,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445789886] [2021-06-05 14:49:14,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 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 14:49:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:49:14,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:49:14,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:49:14,848 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:14,848 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:14,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:14,849 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:14,853 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:14,853 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:14,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 22 treesize of output 16 [2021-06-05 14:49:14,854 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:14,858 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:14,858 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:14,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 23 treesize of output 17 [2021-06-05 14:49:14,860 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:14,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:14,864 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:14,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 30 treesize of output 22 [2021-06-05 14:49:14,865 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:14,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:14,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:14,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:14,870 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:14,874 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:14,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 22 treesize of output 16 [2021-06-05 14:49:14,874 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:15,077 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2021-06-05 14:49:15,077 INFO L628 ElimStorePlain]: treesize reduction 322, result has 47.0 percent of original size [2021-06-05 14:49:15,084 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:15,084 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:15,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 15 treesize of output 11 [2021-06-05 14:49:15,085 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:15,088 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:15,089 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:15,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:15,090 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:15,093 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:15,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 23 treesize of output 17 [2021-06-05 14:49:15,094 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:15,183 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:15,186 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:15,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:15,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 31 treesize of output 23 [2021-06-05 14:49:15,189 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:15,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:15,193 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:15,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:15,194 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:15,196 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:15,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:15,197 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:15,327 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2021-06-05 14:49:15,328 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.5 percent of original size [2021-06-05 14:49:15,333 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 14:49:15,333 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:757, output treesize:186 [2021-06-05 14:49:15,831 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2021-06-05 14:49:15,971 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 14:49:15,971 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445789886] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:49:15,971 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:49:15,971 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:49:15,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641716284] [2021-06-05 14:49:15,971 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:49:15,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:49:15,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:49:15,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:49:15,972 INFO L87 Difference]: Start difference. First operand 291 states and 839 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 14:49:16,567 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 108 [2021-06-05 14:49:16,685 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2021-06-05 14:49:17,146 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 112 [2021-06-05 14:49:17,307 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2021-06-05 14:49:17,824 WARN L205 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 124 [2021-06-05 14:49:17,984 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2021-06-05 14:49:18,531 WARN L205 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 131 [2021-06-05 14:49:18,708 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2021-06-05 14:49:19,339 WARN L205 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 140 [2021-06-05 14:49:19,516 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2021-06-05 14:49:19,668 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-06-05 14:49:20,196 WARN L205 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 133 [2021-06-05 14:49:20,759 WARN L205 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 140 [2021-06-05 14:49:20,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:49:20,803 INFO L93 Difference]: Finished difference Result 685 states and 1809 transitions. [2021-06-05 14:49:20,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 14:49:20,803 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 14:49:20,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:49:20,803 INFO L225 Difference]: With dead ends: 685 [2021-06-05 14:49:20,803 INFO L226 Difference]: Without dead ends: 649 [2021-06-05 14:49:20,804 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 5212.7ms TimeCoverageRelationStatistics Valid=291, Invalid=1191, Unknown=0, NotChecked=0, Total=1482 [2021-06-05 14:49:20,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2021-06-05 14:49:20,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 297. [2021-06-05 14:49:20,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 2.9087837837837838) internal successors, (861), 296 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:49:20,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 861 transitions. [2021-06-05 14:49:20,808 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 861 transitions. Word has length 20 [2021-06-05 14:49:20,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:49:20,808 INFO L482 AbstractCegarLoop]: Abstraction has 297 states and 861 transitions. [2021-06-05 14:49:20,808 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 14:49:20,808 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 861 transitions. [2021-06-05 14:49:20,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:49:20,808 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:49:20,808 INFO L521 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 14:49:21,012 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2191,215 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:49:21,013 INFO L430 AbstractCegarLoop]: === Iteration 406 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:49:21,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:49:21,013 INFO L82 PathProgramCache]: Analyzing trace with hash -323092110, now seen corresponding path program 14 times [2021-06-05 14:49:21,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:49:21,013 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729967499] [2021-06-05 14:49:21,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:49:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:49:21,241 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 14:49:21,241 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:49:21,241 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729967499] [2021-06-05 14:49:21,241 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729967499] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:49:21,241 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067719969] [2021-06-05 14:49:21,241 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 14:49:21,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:49:21,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:49:21,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:49:21,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:49:21,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 31 treesize of output 23 [2021-06-05 14:49:21,405 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:21,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:21,408 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:21,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 14:49:21,412 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:21,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:21,415 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:21,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 38 treesize of output 28 [2021-06-05 14:49:21,419 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:21,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:21,422 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:21,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 31 treesize of output 23 [2021-06-05 14:49:21,426 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:21,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:21,429 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:21,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 23 treesize of output 17 [2021-06-05 14:49:21,432 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:21,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:21,436 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:21,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:21,439 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:21,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 30 treesize of output 22 [2021-06-05 14:49:21,443 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:21,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:21,446 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:21,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 37 treesize of output 27 [2021-06-05 14:49:21,450 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:21,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 14:49:21,453 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:21,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 30 treesize of output 22 [2021-06-05 14:49:21,460 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:21,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 31 treesize of output 23 [2021-06-05 14:49:21,464 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:21,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:21,466 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:21,557 INFO L628 ElimStorePlain]: treesize reduction 91, result has 62.6 percent of original size [2021-06-05 14:49:21,559 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:49:21,559 INFO L247 ElimStorePlain]: Needed 19 recursive calls to eliminate 1 variables, input treesize:697, output treesize:152 [2021-06-05 14:49:21,839 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2021-06-05 14:49:21,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 14:49:21,992 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067719969] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:49:21,992 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:49:21,992 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:49:21,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18146942] [2021-06-05 14:49:21,992 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:49:21,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:49:21,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:49:21,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:49:21,992 INFO L87 Difference]: Start difference. First operand 297 states and 861 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 14:49:22,588 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 72 [2021-06-05 14:49:22,833 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2021-06-05 14:49:23,258 WARN L205 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2021-06-05 14:49:23,752 WARN L205 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 97 [2021-06-05 14:49:24,316 WARN L205 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 106 [2021-06-05 14:49:24,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:49:24,335 INFO L93 Difference]: Finished difference Result 511 states and 1430 transitions. [2021-06-05 14:49:24,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:49:24,336 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 14:49:24,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:49:24,336 INFO L225 Difference]: With dead ends: 511 [2021-06-05 14:49:24,336 INFO L226 Difference]: Without dead ends: 496 [2021-06-05 14:49:24,336 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2735.1ms TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:49:24,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-06-05 14:49:24,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 288. [2021-06-05 14:49:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 2.916376306620209) internal successors, (837), 287 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 14:49:24,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 837 transitions. [2021-06-05 14:49:24,340 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 837 transitions. Word has length 20 [2021-06-05 14:49:24,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:49:24,340 INFO L482 AbstractCegarLoop]: Abstraction has 288 states and 837 transitions. [2021-06-05 14:49:24,340 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 14:49:24,340 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 837 transitions. [2021-06-05 14:49:24,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:49:24,340 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:49:24,340 INFO L521 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 14:49:24,540 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2271,216 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:49:24,541 INFO L430 AbstractCegarLoop]: === Iteration 407 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:49:24,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:49:24,541 INFO L82 PathProgramCache]: Analyzing trace with hash 814944546, now seen corresponding path program 15 times [2021-06-05 14:49:24,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:49:24,541 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161345541] [2021-06-05 14:49:24,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:49:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:49:24,857 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2021-06-05 14:49:25,041 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 14:49:25,041 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:49:25,041 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161345541] [2021-06-05 14:49:25,041 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161345541] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:49:25,041 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067669090] [2021-06-05 14:49:25,041 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 14:49:25,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:49:25,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:49:25,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 14:49:25,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:49:25,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:25,886 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:25,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:25,887 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:25,893 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:25,893 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:25,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:25,894 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:25,901 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:25,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:25,901 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:26,364 WARN L205 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 138 [2021-06-05 14:49:26,364 INFO L628 ElimStorePlain]: treesize reduction 245, result has 69.5 percent of original size [2021-06-05 14:49:26,370 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:26,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:26,371 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:26,580 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2021-06-05 14:49:26,581 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:26,586 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:26,587 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:26,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 14:49:26,588 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:26,593 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:26,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:26,594 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:26,797 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2021-06-05 14:49:26,797 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:26,803 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:26,803 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:26,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:26,804 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:26,810 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:26,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:26,811 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:27,007 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-06-05 14:49:27,008 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:27,013 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:27,013 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:27,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:27,016 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:27,021 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:27,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:27,022 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:27,200 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-06-05 14:49:27,200 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:27,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:27,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 14:49:27,208 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:27,386 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-06-05 14:49:27,386 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:27,391 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:27,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:27,392 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:27,569 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-05 14:49:27,570 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:27,575 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:27,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 15 treesize of output 11 [2021-06-05 14:49:27,576 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:27,750 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-05 14:49:27,750 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:27,759 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 14:49:27,759 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 16 variables, input treesize:833, output treesize:435 [2021-06-05 14:49:28,099 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 139 [2021-06-05 14:49:28,397 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 116 [2021-06-05 14:49:28,730 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_371, v_prenex_361, get_6, v_prenex_363, v_prenex_365, v_prenex_367, v_prenex_369, v_prenex_359], 1=[v_prenex_370, v_prenex_360, v_prenex_372, v_prenex_362, v_prenex_364, v_prenex_366, get_0, v_prenex_368]} [2021-06-05 14:49:28,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 38 treesize of output 28 [2021-06-05 14:49:28,742 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:28,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:28,754 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:28,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:28,765 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:28,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 37 treesize of output 27 [2021-06-05 14:49:28,780 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:28,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 14:49:28,793 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:28,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 31 treesize of output 23 [2021-06-05 14:49:28,807 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:29,400 WARN L205 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 122 [2021-06-05 14:49:29,401 INFO L628 ElimStorePlain]: treesize reduction 2054, result has 16.2 percent of original size [2021-06-05 14:49:29,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:29,407 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:29,546 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-06-05 14:49:29,546 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:29,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:29,553 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:29,684 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2021-06-05 14:49:29,684 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:29,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:29,690 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:29,818 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-06-05 14:49:29,819 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:29,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 16 treesize of output 12 [2021-06-05 14:49:29,824 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:29,953 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-06-05 14:49:29,953 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:29,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 16 treesize of output 12 [2021-06-05 14:49:29,958 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:30,082 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-06-05 14:49:30,082 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:30,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:30,087 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:30,207 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-06-05 14:49:30,207 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:30,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 15 treesize of output 11 [2021-06-05 14:49:30,212 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:30,327 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-05 14:49:30,327 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:30,327 INFO L518 ElimStorePlain]: Eliminatee v_prenex_370 vanished before elimination [2021-06-05 14:49:30,327 INFO L518 ElimStorePlain]: Eliminatee v_prenex_360 vanished before elimination [2021-06-05 14:49:30,327 INFO L518 ElimStorePlain]: Eliminatee v_prenex_372 vanished before elimination [2021-06-05 14:49:30,327 INFO L518 ElimStorePlain]: Eliminatee v_prenex_362 vanished before elimination [2021-06-05 14:49:30,327 INFO L518 ElimStorePlain]: Eliminatee v_prenex_364 vanished before elimination [2021-06-05 14:49:30,327 INFO L518 ElimStorePlain]: Eliminatee v_prenex_366 vanished before elimination [2021-06-05 14:49:30,327 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 14:49:30,327 INFO L518 ElimStorePlain]: Eliminatee v_prenex_368 vanished before elimination [2021-06-05 14:49:30,332 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 16 dim-1 vars, End of recursive call: and 14 xjuncts. [2021-06-05 14:49:30,332 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 24 variables, input treesize:2641, output treesize:276 [2021-06-05 14:49:30,522 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2021-06-05 14:49:30,641 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 14:49:30,641 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067669090] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:49:30,641 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:49:30,641 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:49:30,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256022962] [2021-06-05 14:49:30,642 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:49:30,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:49:30,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:49:30,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:49:30,642 INFO L87 Difference]: Start difference. First operand 288 states and 837 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 14:49:31,070 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 82 [2021-06-05 14:49:31,298 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2021-06-05 14:49:31,842 WARN L205 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 180 [2021-06-05 14:49:32,621 WARN L205 SmtUtils]: Spent 702.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 199 [2021-06-05 14:49:33,101 WARN L205 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 103 [2021-06-05 14:49:33,579 WARN L205 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 112 [2021-06-05 14:49:33,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:49:33,594 INFO L93 Difference]: Finished difference Result 437 states and 1237 transitions. [2021-06-05 14:49:33,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:49:33,594 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 14:49:33,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:49:33,595 INFO L225 Difference]: With dead ends: 437 [2021-06-05 14:49:33,595 INFO L226 Difference]: Without dead ends: 410 [2021-06-05 14:49:33,595 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 4119.8ms TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:49:33,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-06-05 14:49:33,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 294. [2021-06-05 14:49:33,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 2.9112627986348123) internal successors, (853), 293 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 14:49:33,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 853 transitions. [2021-06-05 14:49:33,598 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 853 transitions. Word has length 20 [2021-06-05 14:49:33,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:49:33,598 INFO L482 AbstractCegarLoop]: Abstraction has 294 states and 853 transitions. [2021-06-05 14:49:33,598 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 14:49:33,598 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 853 transitions. [2021-06-05 14:49:33,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:49:33,599 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:49:33,599 INFO L521 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 14:49:33,799 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 217 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2293 [2021-06-05 14:49:33,799 INFO L430 AbstractCegarLoop]: === Iteration 408 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:49:33,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:49:33,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1294229222, now seen corresponding path program 16 times [2021-06-05 14:49:33,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:49:33,800 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240708392] [2021-06-05 14:49:33,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:49:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:49:34,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 14:49:34,243 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:49:34,243 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240708392] [2021-06-05 14:49:34,243 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240708392] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:49:34,243 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767620864] [2021-06-05 14:49:34,243 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 14:49:34,271 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:49:34,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:49:34,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:49:34,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:49:34,657 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:34,657 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:34,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 22 treesize of output 16 [2021-06-05 14:49:34,662 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:34,667 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:34,667 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:34,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:34,668 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:34,673 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:34,673 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:34,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:34,674 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:34,678 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:34,679 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:34,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 30 treesize of output 22 [2021-06-05 14:49:34,680 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:34,684 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:34,685 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:34,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:34,686 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:34,690 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:34,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 29 treesize of output 21 [2021-06-05 14:49:34,691 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:34,989 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2021-06-05 14:49:34,990 INFO L628 ElimStorePlain]: treesize reduction 418, result has 47.0 percent of original size [2021-06-05 14:49:34,993 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:34,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:34,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 23 treesize of output 17 [2021-06-05 14:49:34,995 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:34,999 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:35,001 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:35,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:35,002 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:35,005 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:35,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 22 treesize of output 16 [2021-06-05 14:49:35,006 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:35,244 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2021-06-05 14:49:35,244 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.7 percent of original size [2021-06-05 14:49:35,248 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:35,249 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:35,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 23 treesize of output 17 [2021-06-05 14:49:35,250 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:35,253 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:35,254 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:35,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:35,255 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:35,274 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:35,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:35,276 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:35,483 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2021-06-05 14:49:35,484 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 14:49:35,490 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 14:49:35,490 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:901, output treesize:266 [2021-06-05 14:49:36,350 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_390, v_prenex_392, get_6, v_prenex_394, v_prenex_384, v_prenex_396, v_prenex_386, v_prenex_398, v_prenex_388, v_prenex_400, v_prenex_411, v_prenex_402, v_prenex_404, v_prenex_406], 1=[v_prenex_391, v_prenex_393, v_prenex_395, v_prenex_385, v_prenex_397, v_prenex_387, v_prenex_399, v_prenex_389, get_0, v_prenex_401, v_prenex_412, v_prenex_403, v_prenex_405, v_prenex_407]} [2021-06-05 14:49:36,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 15 treesize of output 11 [2021-06-05 14:49:36,361 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:36,793 WARN L205 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 251 DAG size of output: 104 [2021-06-05 14:49:36,793 INFO L628 ElimStorePlain]: treesize reduction 1130, result has 23.5 percent of original size [2021-06-05 14:49:36,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 7 treesize of output 5 [2021-06-05 14:49:36,800 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:36,932 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-06-05 14:49:36,932 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:36,932 INFO L518 ElimStorePlain]: Eliminatee get_6 vanished before elimination [2021-06-05 14:49:36,932 INFO L518 ElimStorePlain]: Eliminatee v_prenex_394 vanished before elimination [2021-06-05 14:49:36,932 INFO L518 ElimStorePlain]: Eliminatee v_prenex_384 vanished before elimination [2021-06-05 14:49:36,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 7 treesize of output 5 [2021-06-05 14:49:36,938 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:37,062 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-06-05 14:49:37,062 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:37,062 INFO L518 ElimStorePlain]: Eliminatee v_prenex_386 vanished before elimination [2021-06-05 14:49:37,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:37,067 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:37,189 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-06-05 14:49:37,189 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:37,189 INFO L518 ElimStorePlain]: Eliminatee v_prenex_388 vanished before elimination [2021-06-05 14:49:37,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:37,195 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:37,315 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-06-05 14:49:37,315 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:37,315 INFO L518 ElimStorePlain]: Eliminatee v_prenex_411 vanished before elimination [2021-06-05 14:49:37,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 7 treesize of output 5 [2021-06-05 14:49:37,324 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:37,440 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-06-05 14:49:37,441 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:37,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 9 treesize of output 7 [2021-06-05 14:49:37,447 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:37,561 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-06-05 14:49:37,561 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:37,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:37,566 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:37,678 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-06-05 14:49:37,678 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:37,678 INFO L518 ElimStorePlain]: Eliminatee v_prenex_391 vanished before elimination [2021-06-05 14:49:37,678 INFO L518 ElimStorePlain]: Eliminatee v_prenex_393 vanished before elimination [2021-06-05 14:49:37,678 INFO L518 ElimStorePlain]: Eliminatee v_prenex_395 vanished before elimination [2021-06-05 14:49:37,678 INFO L518 ElimStorePlain]: Eliminatee v_prenex_385 vanished before elimination [2021-06-05 14:49:37,679 INFO L518 ElimStorePlain]: Eliminatee v_prenex_397 vanished before elimination [2021-06-05 14:49:37,679 INFO L518 ElimStorePlain]: Eliminatee v_prenex_387 vanished before elimination [2021-06-05 14:49:37,679 INFO L518 ElimStorePlain]: Eliminatee v_prenex_399 vanished before elimination [2021-06-05 14:49:37,679 INFO L518 ElimStorePlain]: Eliminatee v_prenex_389 vanished before elimination [2021-06-05 14:49:37,679 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 14:49:37,679 INFO L518 ElimStorePlain]: Eliminatee v_prenex_401 vanished before elimination [2021-06-05 14:49:37,679 INFO L518 ElimStorePlain]: Eliminatee v_prenex_412 vanished before elimination [2021-06-05 14:49:37,679 INFO L518 ElimStorePlain]: Eliminatee v_prenex_403 vanished before elimination [2021-06-05 14:49:37,679 INFO L518 ElimStorePlain]: Eliminatee v_prenex_405 vanished before elimination [2021-06-05 14:49:37,679 INFO L518 ElimStorePlain]: Eliminatee v_prenex_407 vanished before elimination [2021-06-05 14:49:37,682 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 14:49:37,682 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 42 variables, input treesize:1485, output treesize:253 [2021-06-05 14:49:37,993 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2021-06-05 14:49:38,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 14:49:38,148 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767620864] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:49:38,148 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:49:38,148 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:49:38,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699117714] [2021-06-05 14:49:38,149 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:49:38,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:49:38,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:49:38,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:49:38,149 INFO L87 Difference]: Start difference. First operand 294 states and 853 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 14:49:38,380 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2021-06-05 14:49:38,641 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-06-05 14:49:38,881 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 67 [2021-06-05 14:49:39,534 WARN L205 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 146 [2021-06-05 14:49:39,721 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 50 [2021-06-05 14:49:40,209 WARN L205 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 91 [2021-06-05 14:49:40,372 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 48 [2021-06-05 14:49:40,957 WARN L205 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 103 [2021-06-05 14:49:41,701 WARN L205 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 114 [2021-06-05 14:49:41,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:49:41,715 INFO L93 Difference]: Finished difference Result 498 states and 1374 transitions. [2021-06-05 14:49:41,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:49:41,715 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 14:49:41,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:49:41,716 INFO L225 Difference]: With dead ends: 498 [2021-06-05 14:49:41,716 INFO L226 Difference]: Without dead ends: 437 [2021-06-05 14:49:41,716 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 4305.4ms TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2021-06-05 14:49:41,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-06-05 14:49:41,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 304. [2021-06-05 14:49:41,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 2.871287128712871) internal successors, (870), 303 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 14:49:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 870 transitions. [2021-06-05 14:49:41,719 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 870 transitions. Word has length 20 [2021-06-05 14:49:41,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:49:41,719 INFO L482 AbstractCegarLoop]: Abstraction has 304 states and 870 transitions. [2021-06-05 14:49:41,719 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 14:49:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 870 transitions. [2021-06-05 14:49:41,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:49:41,720 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:49:41,720 INFO L521 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 14:49:41,920 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2479,218 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:49:41,920 INFO L430 AbstractCegarLoop]: === Iteration 409 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:49:41,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:49:41,920 INFO L82 PathProgramCache]: Analyzing trace with hash -404491166, now seen corresponding path program 17 times [2021-06-05 14:49:41,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:49:41,920 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011409387] [2021-06-05 14:49:41,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:49:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:49:42,362 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 14:49:42,363 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:49:42,363 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011409387] [2021-06-05 14:49:42,363 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011409387] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:49:42,363 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197148577] [2021-06-05 14:49:42,363 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 14:49:42,389 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:49:42,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:49:42,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:49:42,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:49: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 22 treesize of output 16 [2021-06-05 14:49:42,574 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:42,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 14:49:42,577 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:42,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:42,581 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:42,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:42,585 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:42,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 31 treesize of output 23 [2021-06-05 14:49:42,588 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:42,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:42,592 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:42,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:42,596 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:42,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 31 treesize of output 23 [2021-06-05 14:49:42,599 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:42,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:42,603 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:42,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 37 treesize of output 27 [2021-06-05 14:49:42,606 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:42,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:42,610 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:42,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 38 treesize of output 28 [2021-06-05 14:49:42,614 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:42,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 31 treesize of output 23 [2021-06-05 14:49:42,617 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:42,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 23 treesize of output 17 [2021-06-05 14:49:42,621 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:42,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 37 treesize of output 27 [2021-06-05 14:49:42,624 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:42,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 30 treesize of output 22 [2021-06-05 14:49:42,628 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:42,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 23 treesize of output 17 [2021-06-05 14:49:42,631 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:42,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 30 treesize of output 22 [2021-06-05 14:49:42,634 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:42,740 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2021-06-05 14:49:42,740 INFO L628 ElimStorePlain]: treesize reduction 103, result has 63.5 percent of original size [2021-06-05 14:49:42,741 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:49:42,741 INFO L247 ElimStorePlain]: Needed 19 recursive calls to eliminate 1 variables, input treesize:751, output treesize:179 [2021-06-05 14:49:43,059 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 14:49:43,060 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197148577] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:49:43,060 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:49:43,060 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:49:43,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950433773] [2021-06-05 14:49:43,060 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:49:43,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:49:43,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:49:43,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:49:43,060 INFO L87 Difference]: Start difference. First operand 304 states and 870 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 14:49:43,830 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 80 [2021-06-05 14:49:44,151 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2021-06-05 14:49:44,518 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 74 [2021-06-05 14:49:44,954 WARN L205 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 81 [2021-06-05 14:49:44,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:49:44,965 INFO L93 Difference]: Finished difference Result 435 states and 1225 transitions. [2021-06-05 14:49:44,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:49:44,965 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 14:49:44,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:49:44,965 INFO L225 Difference]: With dead ends: 435 [2021-06-05 14:49:44,966 INFO L226 Difference]: Without dead ends: 407 [2021-06-05 14:49:44,966 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 2454.5ms TimeCoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:49:44,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-06-05 14:49:44,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 291. [2021-06-05 14:49:44,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 2.9034482758620688) internal successors, (842), 290 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 14:49:44,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 842 transitions. [2021-06-05 14:49:44,969 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 842 transitions. Word has length 20 [2021-06-05 14:49:44,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:49:44,969 INFO L482 AbstractCegarLoop]: Abstraction has 291 states and 842 transitions. [2021-06-05 14:49:44,969 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 14:49:44,969 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 842 transitions. [2021-06-05 14:49:44,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:49:44,969 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:49:44,969 INFO L521 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 14:49:45,169 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 219 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2620 [2021-06-05 14:49:45,170 INFO L430 AbstractCegarLoop]: === Iteration 410 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:49:45,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:49:45,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1829459024, now seen corresponding path program 18 times [2021-06-05 14:49:45,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:49:45,170 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994608372] [2021-06-05 14:49:45,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:49:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:49:45,373 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 14:49:45,373 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:49:45,373 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994608372] [2021-06-05 14:49:45,373 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994608372] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:49:45,373 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017439552] [2021-06-05 14:49:45,373 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 14:49:45,431 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:49:45,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:49:45,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:49:45,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:49:45,782 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:45,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:45,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 22 treesize of output 16 [2021-06-05 14:49:45,784 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:45,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:45,789 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:45,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 22 treesize of output 16 [2021-06-05 14:49:45,789 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:45,794 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:45,794 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:45,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:45,795 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:45,799 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:45,799 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:45,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:45,801 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:45,805 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:45,805 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:45,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:45,806 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:45,810 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:45,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:45,811 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:46,062 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2021-06-05 14:49:46,063 INFO L628 ElimStorePlain]: treesize reduction 352, result has 48.9 percent of original size [2021-06-05 14:49:46,067 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:46,067 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:46,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:46,068 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:46,072 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:46,072 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:46,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 22 treesize of output 16 [2021-06-05 14:49:46,073 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:46,076 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:46,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:46,077 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:46,189 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-06-05 14:49:46,189 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:46,193 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:46,193 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:46,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:46,194 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:46,198 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:46,198 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:46,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:46,199 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:46,202 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:46,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 30 treesize of output 22 [2021-06-05 14:49:46,203 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:46,377 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2021-06-05 14:49:46,378 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 14:49:46,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 14:49:46,383 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:847, output treesize:238 [2021-06-05 14:49:46,892 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 14:49:46,893 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017439552] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:49:46,893 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:49:46,893 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:49:46,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738675919] [2021-06-05 14:49:46,893 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:49:46,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:49:46,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:49:46,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:49:46,893 INFO L87 Difference]: Start difference. First operand 291 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 14:49:47,849 WARN L205 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 120 [2021-06-05 14:49:48,247 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2021-06-05 14:49:48,601 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2021-06-05 14:49:49,010 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2021-06-05 14:49:49,145 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2021-06-05 14:49:49,436 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2021-06-05 14:49:49,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:49:49,437 INFO L93 Difference]: Finished difference Result 536 states and 1457 transitions. [2021-06-05 14:49:49,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 14:49:49,437 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 14:49:49,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:49:49,438 INFO L225 Difference]: With dead ends: 536 [2021-06-05 14:49:49,438 INFO L226 Difference]: Without dead ends: 500 [2021-06-05 14:49:49,438 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 2829.2ms TimeCoverageRelationStatistics Valid=227, Invalid=963, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 14:49:49,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2021-06-05 14:49:49,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 303. [2021-06-05 14:49:49,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 2.903973509933775) internal successors, (877), 302 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:49:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 877 transitions. [2021-06-05 14:49:49,442 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 877 transitions. Word has length 20 [2021-06-05 14:49:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:49:49,442 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 877 transitions. [2021-06-05 14:49:49,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 14:49:49,442 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 877 transitions. [2021-06-05 14:49:49,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:49:49,442 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:49:49,442 INFO L521 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 14:49:49,642 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 220 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2650 [2021-06-05 14:49:49,643 INFO L430 AbstractCegarLoop]: === Iteration 411 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:49:49,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:49:49,643 INFO L82 PathProgramCache]: Analyzing trace with hash 130738636, now seen corresponding path program 19 times [2021-06-05 14:49:49,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:49:49,643 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748959501] [2021-06-05 14:49:49,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:49:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:49:50,019 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 14:49:50,019 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:49:50,019 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748959501] [2021-06-05 14:49:50,019 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748959501] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:49:50,019 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642208493] [2021-06-05 14:49:50,020 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 14:49:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:49:50,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:49:50,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:49:50,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:50,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:50,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:50,819 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:50,826 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:50,826 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:50,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 31 treesize of output 23 [2021-06-05 14:49:50,827 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:50,833 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:50,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:50,834 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:51,222 WARN L205 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 126 [2021-06-05 14:49:51,223 INFO L628 ElimStorePlain]: treesize reduction 182, result has 73.1 percent of original size [2021-06-05 14:49:51,228 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:51,229 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:51,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:51,230 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:51,235 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:51,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:51,236 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:51,410 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-06-05 14:49:51,410 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:51,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:51,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:51,417 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:51,591 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-06-05 14:49:51,591 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:51,597 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:51,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 14:49:51,598 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:51,769 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-06-05 14:49:51,769 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:51,774 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:51,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:51,775 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:51,942 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-06-05 14:49:51,942 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:51,948 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:51,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 15 treesize of output 11 [2021-06-05 14:49:51,949 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:52,114 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-06-05 14:49:52,114 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:52,119 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:52,119 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:52,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:52,120 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:52,125 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:52,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:52,126 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:52,286 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-05 14:49:52,286 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:52,291 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:52,291 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:52,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 14:49:52,292 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:52,297 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:52,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 14:49:52,297 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:52,453 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-06-05 14:49:52,453 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:52,463 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 14:49:52,463 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 16 variables, input treesize:785, output treesize:399 [2021-06-05 14:49:52,783 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 128 [2021-06-05 14:49:53,036 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_481, v_prenex_470, v_prenex_460, v_prenex_450, v_prenex_472, v_prenex_462, v_prenex_474, v_prenex_476, v_prenex_466, v_prenex_456, v_prenex_468, v_prenex_458], 1=[v_prenex_459, v_prenex_449, v_prenex_480, v_prenex_471, v_prenex_461, v_prenex_473, v_prenex_475, v_prenex_465, v_prenex_455, v_prenex_467, v_prenex_457, v_prenex_469]} [2021-06-05 14:49:53,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:53,048 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:53,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 23 treesize of output 17 [2021-06-05 14:49:53,058 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:53,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:53,068 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:53,478 WARN L205 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 101 [2021-06-05 14:49:53,479 INFO L628 ElimStorePlain]: treesize reduction 934, result has 29.0 percent of original size [2021-06-05 14:49:53,479 INFO L518 ElimStorePlain]: Eliminatee v_prenex_470 vanished before elimination [2021-06-05 14:49:53,479 INFO L518 ElimStorePlain]: Eliminatee v_prenex_460 vanished before elimination [2021-06-05 14:49:53,479 INFO L518 ElimStorePlain]: Eliminatee v_prenex_450 vanished before elimination [2021-06-05 14:49:53,479 INFO L518 ElimStorePlain]: Eliminatee v_prenex_472 vanished before elimination [2021-06-05 14:49:53,479 INFO L518 ElimStorePlain]: Eliminatee v_prenex_462 vanished before elimination [2021-06-05 14:49:53,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 16 treesize of output 12 [2021-06-05 14:49:53,484 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:53,614 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-06-05 14:49:53,614 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:53,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:49:53,619 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:53,744 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 14:49:53,744 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:53,744 INFO L518 ElimStorePlain]: Eliminatee v_prenex_466 vanished before elimination [2021-06-05 14:49:53,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 7 treesize of output 5 [2021-06-05 14:49:53,750 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:53,872 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-05 14:49:53,873 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:53,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 7 treesize of output 5 [2021-06-05 14:49:53,877 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:54,003 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-06-05 14:49:54,003 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:54,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 7 treesize of output 5 [2021-06-05 14:49:54,008 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:54,128 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-06-05 14:49:54,129 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:54,129 INFO L518 ElimStorePlain]: Eliminatee v_prenex_459 vanished before elimination [2021-06-05 14:49:54,129 INFO L518 ElimStorePlain]: Eliminatee v_prenex_449 vanished before elimination [2021-06-05 14:49:54,129 INFO L518 ElimStorePlain]: Eliminatee v_prenex_480 vanished before elimination [2021-06-05 14:49:54,129 INFO L518 ElimStorePlain]: Eliminatee v_prenex_471 vanished before elimination [2021-06-05 14:49:54,129 INFO L518 ElimStorePlain]: Eliminatee v_prenex_461 vanished before elimination [2021-06-05 14:49:54,129 INFO L518 ElimStorePlain]: Eliminatee v_prenex_473 vanished before elimination [2021-06-05 14:49:54,129 INFO L518 ElimStorePlain]: Eliminatee v_prenex_475 vanished before elimination [2021-06-05 14:49:54,129 INFO L518 ElimStorePlain]: Eliminatee v_prenex_465 vanished before elimination [2021-06-05 14:49:54,129 INFO L518 ElimStorePlain]: Eliminatee v_prenex_455 vanished before elimination [2021-06-05 14:49:54,129 INFO L518 ElimStorePlain]: Eliminatee v_prenex_467 vanished before elimination [2021-06-05 14:49:54,129 INFO L518 ElimStorePlain]: Eliminatee v_prenex_457 vanished before elimination [2021-06-05 14:49:54,129 INFO L518 ElimStorePlain]: Eliminatee v_prenex_469 vanished before elimination [2021-06-05 14:49:54,134 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 14:49:54,134 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 36 variables, input treesize:1407, output treesize:283 [2021-06-05 14:49:54,260 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2021-06-05 14:49:54,435 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2021-06-05 14:49:54,515 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 14:49:54,516 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642208493] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:49:54,516 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:49:54,516 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:49:54,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270302073] [2021-06-05 14:49:54,516 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:49:54,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:49:54,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:49:54,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:49:54,516 INFO L87 Difference]: Start difference. First operand 303 states and 877 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 14:49:54,891 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2021-06-05 14:49:55,100 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 88 [2021-06-05 14:49:55,610 WARN L205 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 177 [2021-06-05 14:49:56,063 WARN L205 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 113 [2021-06-05 14:49:56,350 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 110 [2021-06-05 14:49:56,856 WARN L205 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 120 [2021-06-05 14:49:57,488 WARN L205 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 129 [2021-06-05 14:49:57,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:49:57,515 INFO L93 Difference]: Finished difference Result 500 states and 1379 transitions. [2021-06-05 14:49:57,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:49:57,515 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 14:49:57,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:49:57,516 INFO L225 Difference]: With dead ends: 500 [2021-06-05 14:49:57,516 INFO L226 Difference]: Without dead ends: 444 [2021-06-05 14:49:57,516 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 3894.8ms TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:49:57,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-06-05 14:49:57,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 314. [2021-06-05 14:49:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 2.862619808306709) internal successors, (896), 313 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 14:49:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 896 transitions. [2021-06-05 14:49:57,519 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 896 transitions. Word has length 20 [2021-06-05 14:49:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:49:57,520 INFO L482 AbstractCegarLoop]: Abstraction has 314 states and 896 transitions. [2021-06-05 14:49:57,520 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 14:49:57,520 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 896 transitions. [2021-06-05 14:49:57,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:49:57,520 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:49:57,520 INFO L521 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 14:49:57,721 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2755,221 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:49:57,721 INFO L430 AbstractCegarLoop]: === Iteration 412 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:49:57,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:49:57,721 INFO L82 PathProgramCache]: Analyzing trace with hash -42509056, now seen corresponding path program 20 times [2021-06-05 14:49:57,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:49:57,721 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567247046] [2021-06-05 14:49:57,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:49:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:49:58,005 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 14:49:58,005 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:49:58,005 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567247046] [2021-06-05 14:49:58,005 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567247046] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:49:58,005 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347842037] [2021-06-05 14:49:58,005 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 14:49:58,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:49:58,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:49:58,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 14:49:58,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:49:58,877 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:58,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:58,878 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:59,345 WARN L205 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 138 [2021-06-05 14:49:59,346 INFO L628 ElimStorePlain]: treesize reduction 260, result has 68.5 percent of original size [2021-06-05 14:49:59,352 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:59,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 14:49:59,353 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:59,573 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2021-06-05 14:49:59,574 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:59,580 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:59,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 14:49:59,581 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:59,796 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2021-06-05 14:49:59,797 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:49:59,802 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:59,803 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:59,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 23 treesize of output 17 [2021-06-05 14:49:59,804 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:49:59,809 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:49:59,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:49:59,810 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:00,019 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-06-05 14:50:00,019 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:00,024 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:00,025 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50: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 14:50:00,026 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:00,043 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:00,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 23 treesize of output 17 [2021-06-05 14:50:00,044 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:00,244 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-06-05 14:50:00,245 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:00,251 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:00,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 15 treesize of output 11 [2021-06-05 14:50:00,252 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:00,451 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-06-05 14:50:00,451 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:00,457 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:00,457 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:00,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 14:50:00,458 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:00,464 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:00,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:00,465 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:00,659 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-06-05 14:50:00,659 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:00,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:00,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:00,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:00,666 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:00,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:00,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 14:50:00,672 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:00,847 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-05 14:50:00,847 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:00,858 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 14:50:00,858 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 16 variables, input treesize:833, output treesize:435 [2021-06-05 14:50:01,196 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 139 [2021-06-05 14:50:01,543 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 125 [2021-06-05 14:50:01,839 INFO L446 ElimStorePlain]: Different costs {0=[get_6, v_prenex_531, v_prenex_521, v_prenex_533, v_prenex_511, v_prenex_523, v_prenex_545, v_prenex_513, v_prenex_535, v_prenex_525, v_prenex_515, v_prenex_537, v_prenex_527, v_prenex_517, v_prenex_519, v_prenex_509], 1=[get_3, v_prenex_530, v_prenex_520, v_prenex_532, v_prenex_510, v_prenex_522, v_prenex_544, v_prenex_512, v_prenex_534, v_prenex_524, v_prenex_514, v_prenex_536, v_prenex_526, v_prenex_516, v_prenex_518, v_prenex_508]} [2021-06-05 14:50:01,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 14:50:01,852 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:01,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 23 treesize of output 17 [2021-06-05 14:50:01,865 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:01,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 14:50:01,878 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:02,386 WARN L205 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 126 [2021-06-05 14:50:02,387 INFO L628 ElimStorePlain]: treesize reduction 1287, result has 24.2 percent of original size [2021-06-05 14:50:02,387 INFO L518 ElimStorePlain]: Eliminatee v_prenex_531 vanished before elimination [2021-06-05 14:50:02,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 16 treesize of output 12 [2021-06-05 14:50:02,393 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:02,527 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-06-05 14:50:02,527 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:02,527 INFO L518 ElimStorePlain]: Eliminatee v_prenex_533 vanished before elimination [2021-06-05 14:50:02,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 16 treesize of output 12 [2021-06-05 14:50:02,533 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:02,662 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-06-05 14:50:02,662 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:02,662 INFO L518 ElimStorePlain]: Eliminatee v_prenex_523 vanished before elimination [2021-06-05 14:50:02,662 INFO L518 ElimStorePlain]: Eliminatee v_prenex_545 vanished before elimination [2021-06-05 14:50:02,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 14:50:02,668 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:02,793 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-06-05 14:50:02,793 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:02,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:02,799 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:02,923 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-05 14:50:02,923 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:02,924 INFO L518 ElimStorePlain]: Eliminatee v_prenex_525 vanished before elimination [2021-06-05 14:50:02,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 16 treesize of output 12 [2021-06-05 14:50:02,929 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:03,060 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-06-05 14:50:03,060 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:03,060 INFO L518 ElimStorePlain]: Eliminatee v_prenex_537 vanished before elimination [2021-06-05 14:50:03,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:03,066 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:03,187 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-06-05 14:50:03,187 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:03,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 7 treesize of output 5 [2021-06-05 14:50:03,192 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:03,309 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 14:50:03,310 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:03,310 INFO L518 ElimStorePlain]: Eliminatee v_prenex_519 vanished before elimination [2021-06-05 14:50:03,310 INFO L518 ElimStorePlain]: Eliminatee v_prenex_509 vanished before elimination [2021-06-05 14:50:03,310 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 14:50:03,310 INFO L518 ElimStorePlain]: Eliminatee v_prenex_530 vanished before elimination [2021-06-05 14:50:03,310 INFO L518 ElimStorePlain]: Eliminatee v_prenex_520 vanished before elimination [2021-06-05 14:50:03,310 INFO L518 ElimStorePlain]: Eliminatee v_prenex_532 vanished before elimination [2021-06-05 14:50:03,310 INFO L518 ElimStorePlain]: Eliminatee v_prenex_510 vanished before elimination [2021-06-05 14:50:03,310 INFO L518 ElimStorePlain]: Eliminatee v_prenex_522 vanished before elimination [2021-06-05 14:50:03,310 INFO L518 ElimStorePlain]: Eliminatee v_prenex_544 vanished before elimination [2021-06-05 14:50:03,310 INFO L518 ElimStorePlain]: Eliminatee v_prenex_512 vanished before elimination [2021-06-05 14:50:03,310 INFO L518 ElimStorePlain]: Eliminatee v_prenex_534 vanished before elimination [2021-06-05 14:50:03,310 INFO L518 ElimStorePlain]: Eliminatee v_prenex_524 vanished before elimination [2021-06-05 14:50:03,310 INFO L518 ElimStorePlain]: Eliminatee v_prenex_514 vanished before elimination [2021-06-05 14:50:03,310 INFO L518 ElimStorePlain]: Eliminatee v_prenex_536 vanished before elimination [2021-06-05 14:50:03,310 INFO L518 ElimStorePlain]: Eliminatee v_prenex_526 vanished before elimination [2021-06-05 14:50:03,310 INFO L518 ElimStorePlain]: Eliminatee v_prenex_516 vanished before elimination [2021-06-05 14:50:03,311 INFO L518 ElimStorePlain]: Eliminatee v_prenex_518 vanished before elimination [2021-06-05 14:50:03,311 INFO L518 ElimStorePlain]: Eliminatee v_prenex_508 vanished before elimination [2021-06-05 14:50:03,314 INFO L550 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 32 dim-1 vars, End of recursive call: and 15 xjuncts. [2021-06-05 14:50:03,314 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 48 variables, input treesize:1787, output treesize:294 [2021-06-05 14:50:03,555 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2021-06-05 14:50:03,675 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 14:50:03,675 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347842037] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:50:03,676 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:50:03,676 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:50:03,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133027206] [2021-06-05 14:50:03,676 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:50:03,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:50:03,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:50:03,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:50:03,676 INFO L87 Difference]: Start difference. First operand 314 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 14:50:03,819 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 77 [2021-06-05 14:50:04,012 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 81 [2021-06-05 14:50:04,209 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 85 [2021-06-05 14:50:04,785 WARN L205 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 178 [2021-06-05 14:50:06,091 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 224 DAG size of output: 210 [2021-06-05 14:50:06,488 WARN L205 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 105 [2021-06-05 14:50:06,990 WARN L205 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 114 [2021-06-05 14:50:06,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:50:06,999 INFO L93 Difference]: Finished difference Result 442 states and 1243 transitions. [2021-06-05 14:50:06,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:50:06,999 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 14:50:07,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:50:07,000 INFO L225 Difference]: With dead ends: 442 [2021-06-05 14:50:07,000 INFO L226 Difference]: Without dead ends: 407 [2021-06-05 14:50:07,000 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 4601.3ms TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:50:07,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-06-05 14:50:07,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 294. [2021-06-05 14:50:07,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 2.9112627986348123) internal successors, (853), 293 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 14:50:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 853 transitions. [2021-06-05 14:50:07,003 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 853 transitions. Word has length 20 [2021-06-05 14:50:07,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:50:07,003 INFO L482 AbstractCegarLoop]: Abstraction has 294 states and 853 transitions. [2021-06-05 14:50:07,003 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 14:50:07,004 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 853 transitions. [2021-06-05 14:50:07,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:50:07,004 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:50:07,004 INFO L521 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 14:50:07,204 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 222 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2888 [2021-06-05 14:50:07,205 INFO L430 AbstractCegarLoop]: === Iteration 413 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:50:07,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:50:07,205 INFO L82 PathProgramCache]: Analyzing trace with hash -361470104, now seen corresponding path program 21 times [2021-06-05 14:50:07,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:50:07,205 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692213067] [2021-06-05 14:50:07,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:50:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:50:07,525 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2021-06-05 14:50:07,674 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2021-06-05 14:50:07,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 14:50:07,926 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:50:07,926 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692213067] [2021-06-05 14:50:07,926 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692213067] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:50:07,926 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646956115] [2021-06-05 14:50:07,926 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 14:50:07,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:50:07,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:50:07,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:50:07,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:50:08,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 30 treesize of output 22 [2021-06-05 14:50:08,111 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:08,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 30 treesize of output 22 [2021-06-05 14:50:08,114 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:08,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:08,118 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:08,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:08,122 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:08,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 29 treesize of output 21 [2021-06-05 14:50:08,126 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:08,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:08,130 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:08,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:08,134 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:08,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 37 treesize of output 27 [2021-06-05 14:50:08,138 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:08,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 30 treesize of output 22 [2021-06-05 14:50:08,141 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:08,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 14:50:08,145 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:08,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 22 treesize of output 16 [2021-06-05 14:50:08,148 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:08,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:08,152 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:08,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:08,155 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:08,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:08,159 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:08,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:08,163 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:08,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:08,166 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:08,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:08,170 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:08,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:08,173 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:08,284 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2021-06-05 14:50:08,284 INFO L628 ElimStorePlain]: treesize reduction 103, result has 63.5 percent of original size [2021-06-05 14:50:08,286 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:50:08,286 INFO L247 ElimStorePlain]: Needed 19 recursive calls to eliminate 1 variables, input treesize:751, output treesize:179 [2021-06-05 14:50:08,766 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 14:50:08,766 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646956115] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:50:08,766 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:50:08,766 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:50:08,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531568886] [2021-06-05 14:50:08,766 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:50:08,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:50:08,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:50:08,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:50:08,767 INFO L87 Difference]: Start difference. First operand 294 states and 853 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 14:50:09,402 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2021-06-05 14:50:09,857 WARN L205 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 100 [2021-06-05 14:50:10,097 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 38 [2021-06-05 14:50:10,525 WARN L205 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 110 [2021-06-05 14:50:10,730 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 40 [2021-06-05 14:50:11,606 WARN L205 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 119 [2021-06-05 14:50:12,368 WARN L205 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 126 [2021-06-05 14:50:12,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:50:12,399 INFO L93 Difference]: Finished difference Result 572 states and 1592 transitions. [2021-06-05 14:50:12,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:50:12,400 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 14:50:12,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:50:12,400 INFO L225 Difference]: With dead ends: 572 [2021-06-05 14:50:12,400 INFO L226 Difference]: Without dead ends: 490 [2021-06-05 14:50:12,400 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 4410.2ms TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2021-06-05 14:50:12,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-06-05 14:50:12,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 328. [2021-06-05 14:50:12,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 2.8776758409785934) internal successors, (941), 327 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:50:12,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 941 transitions. [2021-06-05 14:50:12,404 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 941 transitions. Word has length 20 [2021-06-05 14:50:12,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:50:12,404 INFO L482 AbstractCegarLoop]: Abstraction has 328 states and 941 transitions. [2021-06-05 14:50:12,404 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 14:50:12,404 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 941 transitions. [2021-06-05 14:50:12,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:50:12,405 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:50:12,405 INFO L521 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 14:50:12,619 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3048,223 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:50:12,620 INFO L430 AbstractCegarLoop]: === Iteration 414 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:50:12,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:50:12,620 INFO L82 PathProgramCache]: Analyzing trace with hash -758387758, now seen corresponding path program 22 times [2021-06-05 14:50:12,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:50:12,620 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954795164] [2021-06-05 14:50:12,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:50:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:50:13,129 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 14:50:13,129 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:50:13,129 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954795164] [2021-06-05 14:50:13,129 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954795164] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:50:13,129 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252826769] [2021-06-05 14:50:13,130 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 14:50:13,155 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:50:13,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:50:13,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:50:13,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:50:13,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:13,660 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:13,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 30 treesize of output 22 [2021-06-05 14:50:13,661 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:13,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:13,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:13,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:13,667 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:13,686 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:13,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 14:50:13,688 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:13,942 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 98 [2021-06-05 14:50:13,942 INFO L628 ElimStorePlain]: treesize reduction 120, result has 73.9 percent of original size [2021-06-05 14:50:13,947 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:13,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 23 treesize of output 17 [2021-06-05 14:50:13,948 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:14,069 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-06-05 14:50:14,069 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:14,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:14,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 15 treesize of output 11 [2021-06-05 14:50:14,075 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:14,190 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 14:50:14,190 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:14,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:14,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:14,196 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:14,310 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 14:50:14,310 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:14,315 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:14,315 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:14,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 14:50:14,316 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:14,320 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:14,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 15 treesize of output 11 [2021-06-05 14:50:14,321 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:14,429 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 14:50:14,429 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:14,433 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:14,434 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:14,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 31 treesize of output 23 [2021-06-05 14:50:14,436 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:14,439 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:14,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 14:50:14,441 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:14,539 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:14,545 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 14:50:14,549 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:541, output treesize:250 [2021-06-05 14:50:14,760 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 94 [2021-06-05 14:50:15,197 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_569, get_6, v_prenex_571, v_prenex_573, v_prenex_563, v_prenex_565, v_prenex_567], 1=[get_3, v_prenex_570, v_prenex_572, v_prenex_562, v_prenex_564, v_prenex_566, v_prenex_568]} [2021-06-05 14:50:15,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:15,207 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:15,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:15,216 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:15,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 38 treesize of output 28 [2021-06-05 14:50:15,227 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:15,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:15,236 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:15,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 31 treesize of output 23 [2021-06-05 14:50:15,244 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:15,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:15,253 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:15,798 WARN L205 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 104 [2021-06-05 14:50:15,798 INFO L628 ElimStorePlain]: treesize reduction 1734, result has 17.1 percent of original size [2021-06-05 14:50:15,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 16 treesize of output 12 [2021-06-05 14:50:15,804 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:15,940 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-06-05 14:50:15,940 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:15,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:15,960 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:16,097 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 14:50:16,098 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:16,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 14:50:16,104 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:16,236 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-06-05 14:50:16,236 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:16,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:16,242 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:16,369 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-06-05 14:50:16,369 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:16,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 9 treesize of output 7 [2021-06-05 14:50:16,374 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:16,499 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-06-05 14:50:16,499 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:16,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 7 treesize of output 5 [2021-06-05 14:50:16,504 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:16,624 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-06-05 14:50:16,624 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:16,624 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 14:50:16,624 INFO L518 ElimStorePlain]: Eliminatee v_prenex_570 vanished before elimination [2021-06-05 14:50:16,624 INFO L518 ElimStorePlain]: Eliminatee v_prenex_572 vanished before elimination [2021-06-05 14:50:16,624 INFO L518 ElimStorePlain]: Eliminatee v_prenex_562 vanished before elimination [2021-06-05 14:50:16,624 INFO L518 ElimStorePlain]: Eliminatee v_prenex_564 vanished before elimination [2021-06-05 14:50:16,624 INFO L518 ElimStorePlain]: Eliminatee v_prenex_566 vanished before elimination [2021-06-05 14:50:16,624 INFO L518 ElimStorePlain]: Eliminatee v_prenex_568 vanished before elimination [2021-06-05 14:50:16,628 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 14:50:16,628 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 21 variables, input treesize:2293, output treesize:253 [2021-06-05 14:50:16,761 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-06-05 14:50:16,970 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2021-06-05 14:50:17,139 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 14:50:17,139 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252826769] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:50:17,139 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:50:17,139 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:50:17,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331684347] [2021-06-05 14:50:17,139 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:50:17,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:50:17,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:50:17,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:50:17,140 INFO L87 Difference]: Start difference. First operand 328 states and 941 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 14:50:17,599 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2021-06-05 14:50:18,071 WARN L205 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 122 [2021-06-05 14:50:18,637 WARN L205 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 126 [2021-06-05 14:50:19,255 WARN L205 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 136 [2021-06-05 14:50:19,990 WARN L205 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 149 [2021-06-05 14:50:20,888 WARN L205 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 159 [2021-06-05 14:50:20,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:50:20,904 INFO L93 Difference]: Finished difference Result 548 states and 1491 transitions. [2021-06-05 14:50:20,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:50:20,905 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 14:50:20,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:50:20,905 INFO L225 Difference]: With dead ends: 548 [2021-06-05 14:50:20,905 INFO L226 Difference]: Without dead ends: 527 [2021-06-05 14:50:20,905 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 4738.9ms TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:50:20,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2021-06-05 14:50:20,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 334. [2021-06-05 14:50:20,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 2.873873873873874) internal successors, (957), 333 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:50:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 957 transitions. [2021-06-05 14:50:20,909 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 957 transitions. Word has length 20 [2021-06-05 14:50:20,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:50:20,909 INFO L482 AbstractCegarLoop]: Abstraction has 334 states and 957 transitions. [2021-06-05 14:50:20,909 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 14:50:20,909 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 957 transitions. [2021-06-05 14:50:20,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:50:20,910 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:50:20,910 INFO L521 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 14:50:21,110 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 224 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3080 [2021-06-05 14:50:21,110 INFO L430 AbstractCegarLoop]: === Iteration 415 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:50:21,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:50:21,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1837859150, now seen corresponding path program 23 times [2021-06-05 14:50:21,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:50:21,111 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156254465] [2021-06-05 14:50:21,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:50:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:50:21,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 14:50:21,523 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:50:21,523 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156254465] [2021-06-05 14:50:21,523 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156254465] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:50:21,523 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193344103] [2021-06-05 14:50:21,523 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 14:50:21,549 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:50:21,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:50:21,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:50:21,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:50:21,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:21,749 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:21,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:21,752 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:21,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:21,755 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:21,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 37 treesize of output 27 [2021-06-05 14:50:21,759 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:21,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 31 treesize of output 23 [2021-06-05 14:50:21,762 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:21,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:21,766 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:21,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 38 treesize of output 28 [2021-06-05 14:50:21,769 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:21,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 29 treesize of output 21 [2021-06-05 14:50:21,773 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:21,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:21,776 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:21,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 14:50:21,780 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:21,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 31 treesize of output 23 [2021-06-05 14:50:21,783 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:21,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:21,792 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:21,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 30 treesize of output 22 [2021-06-05 14:50:21,795 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:21,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:21,798 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:21,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:21,802 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:21,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 22 treesize of output 16 [2021-06-05 14:50:21,805 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:21,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:21,809 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:21,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 14:50:21,812 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:21,906 INFO L628 ElimStorePlain]: treesize reduction 97, result has 61.0 percent of original size [2021-06-05 14:50:21,907 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:50:21,907 INFO L247 ElimStorePlain]: Needed 19 recursive calls to eliminate 1 variables, input treesize:697, output treesize:152 [2021-06-05 14:50:22,303 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 14:50:22,303 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193344103] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:50:22,303 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:50:22,303 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:50:22,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126387850] [2021-06-05 14:50:22,304 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:50:22,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:50:22,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:50:22,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:50:22,304 INFO L87 Difference]: Start difference. First operand 334 states and 957 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 14:50:22,874 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2021-06-05 14:50:23,144 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 72 [2021-06-05 14:50:23,620 WARN L205 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 92 [2021-06-05 14:50:24,050 WARN L205 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 93 [2021-06-05 14:50:24,581 WARN L205 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 99 [2021-06-05 14:50:25,248 WARN L205 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 104 [2021-06-05 14:50:25,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:50:25,272 INFO L93 Difference]: Finished difference Result 580 states and 1567 transitions. [2021-06-05 14:50:25,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:50:25,273 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 14:50:25,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:50:25,273 INFO L225 Difference]: With dead ends: 580 [2021-06-05 14:50:25,273 INFO L226 Difference]: Without dead ends: 499 [2021-06-05 14:50:25,273 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 3463.1ms TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2021-06-05 14:50:25,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2021-06-05 14:50:25,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 327. [2021-06-05 14:50:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 2.861963190184049) internal successors, (933), 326 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:50:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 933 transitions. [2021-06-05 14:50:25,277 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 933 transitions. Word has length 20 [2021-06-05 14:50:25,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:50:25,277 INFO L482 AbstractCegarLoop]: Abstraction has 327 states and 933 transitions. [2021-06-05 14:50:25,277 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 14:50:25,277 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 933 transitions. [2021-06-05 14:50:25,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:50:25,278 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:50:25,278 INFO L521 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 14:50:25,478 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3207,225 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:50:25,478 INFO L430 AbstractCegarLoop]: === Iteration 416 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:50:25,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:50:25,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1664611458, now seen corresponding path program 24 times [2021-06-05 14:50:25,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:50:25,479 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226677914] [2021-06-05 14:50:25,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:50:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:50:25,773 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 14:50:25,773 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:50:25,773 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226677914] [2021-06-05 14:50:25,773 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226677914] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:50:25,773 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255732611] [2021-06-05 14:50:25,773 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 14:50:25,800 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:50:25,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:50:25,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:50:25,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:50:26,099 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:26,099 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:26,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 30 treesize of output 22 [2021-06-05 14:50:26,100 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:26,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:26,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:26,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:26,106 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:26,110 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:26,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 23 treesize of output 17 [2021-06-05 14:50:26,111 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:26,312 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2021-06-05 14:50:26,313 INFO L628 ElimStorePlain]: treesize reduction 141, result has 68.0 percent of original size [2021-06-05 14:50:26,317 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:26,317 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:26,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:26,319 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:26,322 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:26,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 14:50:26,323 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:26,416 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:26,420 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:26,420 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:26,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:26,422 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:26,425 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:26,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 14:50:26,426 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:26,500 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:26,504 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:26,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:26,505 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:26,589 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:26,592 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:26,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:26,593 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:26,664 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:26,668 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:26,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:26,669 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:26,738 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:26,744 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 14:50:26,744 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:469, output treesize:196 [2021-06-05 14:50:26,894 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2021-06-05 14:50:27,187 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2021-06-05 14:50:27,459 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 14:50:27,460 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255732611] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:50:27,460 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:50:27,460 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:50:27,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904900938] [2021-06-05 14:50:27,463 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:50:27,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:50:27,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:50:27,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:50:27,464 INFO L87 Difference]: Start difference. First operand 327 states and 933 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 14:50:28,142 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-06-05 14:50:28,296 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2021-06-05 14:50:28,604 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-06-05 14:50:28,829 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2021-06-05 14:50:28,982 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-06-05 14:50:29,236 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2021-06-05 14:50:29,394 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 14:50:29,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:50:29,517 INFO L93 Difference]: Finished difference Result 630 states and 1709 transitions. [2021-06-05 14:50:29,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 14:50:29,517 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 14:50:29,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:50:29,518 INFO L225 Difference]: With dead ends: 630 [2021-06-05 14:50:29,518 INFO L226 Difference]: Without dead ends: 578 [2021-06-05 14:50:29,518 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2541.9ms TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2021-06-05 14:50:29,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2021-06-05 14:50:29,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 327. [2021-06-05 14:50:29,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 2.914110429447853) internal successors, (950), 326 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:50:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 950 transitions. [2021-06-05 14:50:29,522 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 950 transitions. Word has length 20 [2021-06-05 14:50:29,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:50:29,523 INFO L482 AbstractCegarLoop]: Abstraction has 327 states and 950 transitions. [2021-06-05 14:50:29,523 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 14:50:29,523 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 950 transitions. [2021-06-05 14:50:29,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:50:29,523 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:50:29,523 INFO L521 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 14:50:29,723 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 226 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3229 [2021-06-05 14:50:29,723 INFO L430 AbstractCegarLoop]: === Iteration 417 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:50:29,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:50:29,724 INFO L82 PathProgramCache]: Analyzing trace with hash -678810648, now seen corresponding path program 25 times [2021-06-05 14:50:29,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:50:29,724 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804113662] [2021-06-05 14:50:29,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:50:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:50:30,054 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 14:50:30,054 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:50:30,054 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804113662] [2021-06-05 14:50:30,054 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804113662] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:50:30,054 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830186803] [2021-06-05 14:50:30,054 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 14:50:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:50:30,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:50:30,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:50:30,452 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:30,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:30,453 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:30,717 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2021-06-05 14:50:30,718 INFO L628 ElimStorePlain]: treesize reduction 171, result has 67.2 percent of original size [2021-06-05 14:50:30,722 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:30,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 15 treesize of output 11 [2021-06-05 14:50:30,723 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:30,847 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-06-05 14:50:30,847 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:30,852 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:30,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:30,853 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:30,970 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 14:50:30,970 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:30,974 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:30,974 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:30,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:30,975 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:30,979 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:30,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:30,980 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:31,088 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 14:50:31,088 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:31,092 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:31,092 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:31,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 23 treesize of output 17 [2021-06-05 14:50:31,093 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:31,097 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:31,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:31,098 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:31,200 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-06-05 14:50:31,200 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:31,204 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:31,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:31,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 14:50:31,206 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:31,209 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:31,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 23 treesize of output 17 [2021-06-05 14:50:31,210 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:31,300 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:31,306 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 14:50:31,306 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:529, output treesize:241 [2021-06-05 14:50:31,493 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 88 [2021-06-05 14:50:31,952 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 14:50:31,952 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830186803] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:50:31,952 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:50:31,952 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:50:31,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802312348] [2021-06-05 14:50:31,952 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:50:31,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:50:31,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:50:31,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:50:31,953 INFO L87 Difference]: Start difference. First operand 327 states and 950 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 14:50:32,348 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2021-06-05 14:50:32,630 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2021-06-05 14:50:33,036 WARN L205 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 125 [2021-06-05 14:50:33,550 WARN L205 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 130 [2021-06-05 14:50:33,739 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2021-06-05 14:50:33,960 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2021-06-05 14:50:33,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:50:33,971 INFO L93 Difference]: Finished difference Result 472 states and 1340 transitions. [2021-06-05 14:50:33,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:50:33,971 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 14:50:33,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:50:33,971 INFO L225 Difference]: With dead ends: 472 [2021-06-05 14:50:33,971 INFO L226 Difference]: Without dead ends: 445 [2021-06-05 14:50:33,972 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 2608.1ms TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:50:33,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-06-05 14:50:33,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 333. [2021-06-05 14:50:33,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 2.9096385542168677) internal successors, (966), 332 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:50:33,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 966 transitions. [2021-06-05 14:50:33,975 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 966 transitions. Word has length 20 [2021-06-05 14:50:33,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:50:33,975 INFO L482 AbstractCegarLoop]: Abstraction has 333 states and 966 transitions. [2021-06-05 14:50:33,975 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 14:50:33,975 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 966 transitions. [2021-06-05 14:50:33,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:50:33,976 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:50:33,976 INFO L521 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 14:50:34,176 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3306,227 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:50:34,176 INFO L430 AbstractCegarLoop]: === Iteration 418 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:50:34,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:50:34,176 INFO L82 PathProgramCache]: Analyzing trace with hash -199525972, now seen corresponding path program 26 times [2021-06-05 14:50:34,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:50:34,176 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916069753] [2021-06-05 14:50:34,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:50:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:50:34,523 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 14:50:34,524 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:50:34,524 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916069753] [2021-06-05 14:50:34,524 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916069753] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:50:34,524 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752520628] [2021-06-05 14:50:34,524 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 14:50:34,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:50:34,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:50:34,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:50:34,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:50:35,171 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:35,172 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:35,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:35,173 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:35,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:35,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:35,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 23 treesize of output 17 [2021-06-05 14:50:35,179 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:35,184 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:35,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 30 treesize of output 22 [2021-06-05 14:50:35,185 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:35,513 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 104 [2021-06-05 14:50:35,513 INFO L628 ElimStorePlain]: treesize reduction 174, result has 69.6 percent of original size [2021-06-05 14:50:35,518 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:35,518 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:35,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 23 treesize of output 17 [2021-06-05 14:50:35,520 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:35,524 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:35,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:35,525 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:35,667 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-06-05 14:50:35,667 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:35,672 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:35,672 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:35,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:35,673 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:35,677 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:35,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:35,678 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:35,804 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 14:50:35,804 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:35,809 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:35,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:35,810 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:35,932 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 14:50:35,932 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:35,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:35,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:35,937 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:36,058 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 14:50:36,058 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:36,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:36,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:36,064 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:36,190 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-06-05 14:50:36,191 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:36,197 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 14:50:36,197 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:601, output treesize:295 [2021-06-05 14:50:36,441 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 98 [2021-06-05 14:50:36,689 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_613, v_prenex_615, v_prenex_617, get_6, v_prenex_619, v_prenex_621, v_prenex_623], 1=[v_prenex_624, v_prenex_614, v_prenex_616, v_prenex_618, get_0, v_prenex_620, v_prenex_622]} [2021-06-05 14:50:36,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:36,699 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:36,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 30 treesize of output 22 [2021-06-05 14:50:36,708 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:36,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 22 treesize of output 16 [2021-06-05 14:50:36,717 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:36,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:36,726 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:36,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 22 treesize of output 16 [2021-06-05 14:50:36,735 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:36,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 14:50:36,744 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:37,317 WARN L205 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 103 [2021-06-05 14:50:37,318 INFO L628 ElimStorePlain]: treesize reduction 1763, result has 16.8 percent of original size [2021-06-05 14:50:37,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 9 treesize of output 7 [2021-06-05 14:50:37,330 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:37,469 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-06-05 14:50:37,469 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:37,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 7 treesize of output 5 [2021-06-05 14:50:37,475 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:37,616 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-06-05 14:50:37,616 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:37,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 15 treesize of output 11 [2021-06-05 14:50:37,622 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:37,752 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 14:50:37,752 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:37,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:37,758 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:37,885 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-06-05 14:50:37,885 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:37,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 16 treesize of output 12 [2021-06-05 14:50:37,890 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:38,006 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-06-05 14:50:38,007 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:38,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 7 treesize of output 5 [2021-06-05 14:50:38,011 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:38,132 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-06-05 14:50:38,133 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:38,133 INFO L518 ElimStorePlain]: Eliminatee v_prenex_624 vanished before elimination [2021-06-05 14:50:38,133 INFO L518 ElimStorePlain]: Eliminatee v_prenex_614 vanished before elimination [2021-06-05 14:50:38,133 INFO L518 ElimStorePlain]: Eliminatee v_prenex_616 vanished before elimination [2021-06-05 14:50:38,133 INFO L518 ElimStorePlain]: Eliminatee v_prenex_618 vanished before elimination [2021-06-05 14:50:38,133 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 14:50:38,133 INFO L518 ElimStorePlain]: Eliminatee v_prenex_620 vanished before elimination [2021-06-05 14:50:38,133 INFO L518 ElimStorePlain]: Eliminatee v_prenex_622 vanished before elimination [2021-06-05 14:50:38,141 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 14:50:38,141 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 21 variables, input treesize:2293, output treesize:253 [2021-06-05 14:50:38,446 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2021-06-05 14:50:38,534 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 14:50:38,534 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752520628] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:50:38,534 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:50:38,534 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:50:38,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543163965] [2021-06-05 14:50:38,534 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:50:38,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:50:38,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:50:38,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:50:38,535 INFO L87 Difference]: Start difference. First operand 333 states and 966 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 14:50:39,013 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2021-06-05 14:50:39,319 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2021-06-05 14:50:39,821 WARN L205 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 142 [2021-06-05 14:50:40,181 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2021-06-05 14:50:40,569 WARN L205 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 94 [2021-06-05 14:50:41,072 WARN L205 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 106 [2021-06-05 14:50:41,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:50:41,091 INFO L93 Difference]: Finished difference Result 493 states and 1383 transitions. [2021-06-05 14:50:41,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:50:41,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 14:50:41,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:50:41,092 INFO L225 Difference]: With dead ends: 493 [2021-06-05 14:50:41,092 INFO L226 Difference]: Without dead ends: 472 [2021-06-05 14:50:41,092 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 3273.1ms TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:50:41,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-06-05 14:50:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 336. [2021-06-05 14:50:41,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 2.9074626865671642) internal successors, (974), 335 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:50:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 974 transitions. [2021-06-05 14:50:41,096 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 974 transitions. Word has length 20 [2021-06-05 14:50:41,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:50:41,096 INFO L482 AbstractCegarLoop]: Abstraction has 336 states and 974 transitions. [2021-06-05 14:50:41,096 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 14:50:41,096 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 974 transitions. [2021-06-05 14:50:41,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:50:41,096 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:50:41,096 INFO L521 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 14:50:41,304 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 228 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3384 [2021-06-05 14:50:41,305 INFO L430 AbstractCegarLoop]: === Iteration 419 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:50:41,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:50:41,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1898246360, now seen corresponding path program 27 times [2021-06-05 14:50:41,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:50:41,305 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891226729] [2021-06-05 14:50:41,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:50:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:50:41,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 14:50:41,727 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:50:41,727 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891226729] [2021-06-05 14:50:41,727 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891226729] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:50:41,727 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490584967] [2021-06-05 14:50:41,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 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 14:50:41,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:50:41,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:50:41,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:50:41,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:50:42,101 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:42,102 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:42,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:42,103 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:42,108 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:42,108 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:42,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 14:50:42,109 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:42,114 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:42,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 14:50:42,114 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:42,373 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2021-06-05 14:50:42,374 INFO L628 ElimStorePlain]: treesize reduction 156, result has 68.8 percent of original size [2021-06-05 14:50:42,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:42,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:42,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 14:50:42,379 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:42,383 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:42,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 14:50:42,384 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:42,492 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 14:50:42,492 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:42,496 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:42,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:42,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:42,498 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:42,502 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:42,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:42,503 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:42,599 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:42,603 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:42,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:42,605 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:42,698 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:42,702 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:42,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 15 treesize of output 11 [2021-06-05 14:50:42,703 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:42,794 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:42,798 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:42,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 23 treesize of output 17 [2021-06-05 14:50:42,799 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:42,886 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:42,892 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 14:50:42,892 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:529, output treesize:241 [2021-06-05 14:50:43,081 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 88 [2021-06-05 14:50:43,496 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 14:50:43,496 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490584967] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:50:43,496 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:50:43,496 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:50:43,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545816264] [2021-06-05 14:50:43,496 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:50:43,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:50:43,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:50:43,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:50:43,497 INFO L87 Difference]: Start difference. First operand 336 states and 974 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 14:50:43,905 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2021-06-05 14:50:44,176 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2021-06-05 14:50:44,593 WARN L205 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 131 [2021-06-05 14:50:44,842 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2021-06-05 14:50:45,198 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2021-06-05 14:50:45,609 WARN L205 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 85 [2021-06-05 14:50:45,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:50:45,634 INFO L93 Difference]: Finished difference Result 470 states and 1341 transitions. [2021-06-05 14:50:45,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:50:45,634 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 14:50:45,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:50:45,634 INFO L225 Difference]: With dead ends: 470 [2021-06-05 14:50:45,635 INFO L226 Difference]: Without dead ends: 455 [2021-06-05 14:50:45,635 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2707.8ms TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:50:45,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2021-06-05 14:50:45,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 330. [2021-06-05 14:50:45,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 2.911854103343465) internal successors, (958), 329 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:50:45,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 958 transitions. [2021-06-05 14:50:45,638 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 958 transitions. Word has length 20 [2021-06-05 14:50:45,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:50:45,638 INFO L482 AbstractCegarLoop]: Abstraction has 330 states and 958 transitions. [2021-06-05 14:50:45,638 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 14:50:45,638 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 958 transitions. [2021-06-05 14:50:45,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:50:45,639 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:50:45,639 INFO L521 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 14:50:45,839 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 229 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3507 [2021-06-05 14:50:45,839 INFO L430 AbstractCegarLoop]: === Iteration 420 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:50:45,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:50:45,840 INFO L82 PathProgramCache]: Analyzing trace with hash 335703830, now seen corresponding path program 28 times [2021-06-05 14:50:45,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:50:45,840 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116151317] [2021-06-05 14:50:45,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:50:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:50:46,197 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 14:50:46,197 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:50:46,197 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116151317] [2021-06-05 14:50:46,197 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116151317] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:50:46,197 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798473650] [2021-06-05 14:50:46,197 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 14:50:46,223 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:50:46,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:50:46,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 14:50:46,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:50:46,763 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:46,764 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:46,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 30 treesize of output 22 [2021-06-05 14:50:46,765 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:46,771 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:46,771 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:46,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:46,772 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:46,777 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:46,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:46,778 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:47,106 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 102 [2021-06-05 14:50:47,107 INFO L628 ElimStorePlain]: treesize reduction 130, result has 74.8 percent of original size [2021-06-05 14:50:47,112 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:47,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:47,113 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:47,256 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-06-05 14:50:47,256 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:47,263 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:47,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 23 treesize of output 17 [2021-06-05 14:50:47,264 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:47,437 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-06-05 14:50:47,437 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:47,443 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:47,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 14:50:47,444 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:47,584 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 14:50:47,584 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:47,589 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:47,589 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:47,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 15 treesize of output 11 [2021-06-05 14:50:47,596 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:47,601 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:47,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 14:50:47,602 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:47,738 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 14:50:47,738 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:47,742 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:47,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:47,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 31 treesize of output 23 [2021-06-05 14:50:47,744 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:47,748 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:47,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:47,749 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:47,868 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-06-05 14:50:47,869 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:47,875 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 14:50:47,876 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:601, output treesize:295 [2021-06-05 14:50:48,109 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 98 [2021-06-05 14:50:48,877 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_680, get_6, v_prenex_670, v_prenex_660, v_prenex_672, v_prenex_662, v_prenex_674, v_prenex_652, v_prenex_664, v_prenex_654, v_prenex_666, v_prenex_656, v_prenex_668, v_prenex_658], 1=[get_3, v_prenex_671, v_prenex_661, v_prenex_673, v_prenex_651, v_prenex_663, v_prenex_653, v_prenex_665, v_prenex_655, v_prenex_667, v_prenex_679, v_prenex_657, v_prenex_669, v_prenex_659]} [2021-06-05 14:50:48,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 25 treesize of output 19 [2021-06-05 14:50:48,889 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:48,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 32 treesize of output 24 [2021-06-05 14:50:48,901 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:48,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 25 treesize of output 19 [2021-06-05 14:50:48,912 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:49,354 WARN L205 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 105 [2021-06-05 14:50:49,354 INFO L628 ElimStorePlain]: treesize reduction 1098, result has 26.4 percent of original size [2021-06-05 14:50:49,354 INFO L518 ElimStorePlain]: Eliminatee get_6 vanished before elimination [2021-06-05 14:50:49,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:49,360 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:49,506 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-05 14:50:49,506 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:49,506 INFO L518 ElimStorePlain]: Eliminatee v_prenex_660 vanished before elimination [2021-06-05 14:50:49,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 7 treesize of output 5 [2021-06-05 14:50:49,511 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:49,652 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-06-05 14:50:49,652 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:49,652 INFO L518 ElimStorePlain]: Eliminatee v_prenex_662 vanished before elimination [2021-06-05 14:50:49,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 16 treesize of output 12 [2021-06-05 14:50:49,658 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:49,798 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 14:50:49,798 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:49,798 INFO L518 ElimStorePlain]: Eliminatee v_prenex_652 vanished before elimination [2021-06-05 14:50:49,798 INFO L518 ElimStorePlain]: Eliminatee v_prenex_664 vanished before elimination [2021-06-05 14:50:49,798 INFO L518 ElimStorePlain]: Eliminatee v_prenex_654 vanished before elimination [2021-06-05 14:50:49,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 9 treesize of output 7 [2021-06-05 14:50:49,803 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:49,937 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 14:50:49,937 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:49,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 7 treesize of output 5 [2021-06-05 14:50:49,942 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:50,071 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-06-05 14:50:50,072 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:50,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 16 treesize of output 12 [2021-06-05 14:50:50,076 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:50,204 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-06-05 14:50:50,204 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:50,204 INFO L518 ElimStorePlain]: Eliminatee v_prenex_658 vanished before elimination [2021-06-05 14:50:50,205 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 14:50:50,205 INFO L518 ElimStorePlain]: Eliminatee v_prenex_671 vanished before elimination [2021-06-05 14:50:50,205 INFO L518 ElimStorePlain]: Eliminatee v_prenex_661 vanished before elimination [2021-06-05 14:50:50,205 INFO L518 ElimStorePlain]: Eliminatee v_prenex_673 vanished before elimination [2021-06-05 14:50:50,205 INFO L518 ElimStorePlain]: Eliminatee v_prenex_651 vanished before elimination [2021-06-05 14:50:50,205 INFO L518 ElimStorePlain]: Eliminatee v_prenex_663 vanished before elimination [2021-06-05 14:50:50,205 INFO L518 ElimStorePlain]: Eliminatee v_prenex_653 vanished before elimination [2021-06-05 14:50:50,205 INFO L518 ElimStorePlain]: Eliminatee v_prenex_665 vanished before elimination [2021-06-05 14:50:50,205 INFO L518 ElimStorePlain]: Eliminatee v_prenex_655 vanished before elimination [2021-06-05 14:50:50,205 INFO L518 ElimStorePlain]: Eliminatee v_prenex_667 vanished before elimination [2021-06-05 14:50:50,205 INFO L518 ElimStorePlain]: Eliminatee v_prenex_679 vanished before elimination [2021-06-05 14:50:50,205 INFO L518 ElimStorePlain]: Eliminatee v_prenex_657 vanished before elimination [2021-06-05 14:50:50,205 INFO L518 ElimStorePlain]: Eliminatee v_prenex_669 vanished before elimination [2021-06-05 14:50:50,205 INFO L518 ElimStorePlain]: Eliminatee v_prenex_659 vanished before elimination [2021-06-05 14:50:50,209 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 14:50:50,210 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 42 variables, input treesize:1587, output treesize:292 [2021-06-05 14:50:50,341 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-06-05 14:50:50,535 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2021-06-05 14:50:50,640 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 14:50:50,641 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798473650] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:50:50,641 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:50:50,641 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:50:50,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250172202] [2021-06-05 14:50:50,641 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:50:50,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:50:50,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:50:50,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:50:50,641 INFO L87 Difference]: Start difference. First operand 330 states and 958 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 14:50:51,092 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2021-06-05 14:50:51,366 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2021-06-05 14:50:51,780 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 132 [2021-06-05 14:50:52,135 WARN L205 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2021-06-05 14:50:52,533 WARN L205 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 87 [2021-06-05 14:50:52,994 WARN L205 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 96 [2021-06-05 14:50:53,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:50:53,008 INFO L93 Difference]: Finished difference Result 500 states and 1398 transitions. [2021-06-05 14:50:53,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:50:53,008 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 14:50:53,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:50:53,009 INFO L225 Difference]: With dead ends: 500 [2021-06-05 14:50:53,009 INFO L226 Difference]: Without dead ends: 479 [2021-06-05 14:50:53,009 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 3123.1ms TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:50:53,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-06-05 14:50:53,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 336. [2021-06-05 14:50:53,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 2.9074626865671642) internal successors, (974), 335 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:50:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 974 transitions. [2021-06-05 14:50:53,012 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 974 transitions. Word has length 20 [2021-06-05 14:50:53,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:50:53,012 INFO L482 AbstractCegarLoop]: Abstraction has 336 states and 974 transitions. [2021-06-05 14:50:53,013 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 14:50:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 974 transitions. [2021-06-05 14:50:53,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:50:53,013 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:50:53,013 INFO L521 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 14:50:53,213 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 230 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3603 [2021-06-05 14:50:53,213 INFO L430 AbstractCegarLoop]: === Iteration 421 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:50:53,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:50:53,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1363016558, now seen corresponding path program 29 times [2021-06-05 14:50:53,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:50:53,214 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016195093] [2021-06-05 14:50:53,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:50:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:50:53,478 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 14:50:53,478 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:50:53,478 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016195093] [2021-06-05 14:50:53,478 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016195093] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:50:53,478 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367897302] [2021-06-05 14:50:53,478 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 14:50:53,515 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:50:53,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:50:53,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:50:53,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:50:53,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:53,705 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:53,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 14:50:53,709 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:53,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 31 treesize of output 23 [2021-06-05 14:50:53,712 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:53,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 31 treesize of output 23 [2021-06-05 14:50:53,716 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:53,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 30 treesize of output 22 [2021-06-05 14:50:53,720 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:53,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:53,726 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:53,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 23 treesize of output 17 [2021-06-05 14:50:53,730 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:53,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 14:50:53,733 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:53,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:53,737 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:53,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:53,741 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:53,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:53,745 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:53,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:53,748 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:53,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:53,752 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:53,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:53,755 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:53,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 37 treesize of output 27 [2021-06-05 14:50:53,759 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:53,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 31 treesize of output 23 [2021-06-05 14:50:53,763 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:53,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:50:53,766 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:53,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 22 treesize of output 16 [2021-06-05 14:50:53,769 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:53,877 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2021-06-05 14:50:53,877 INFO L628 ElimStorePlain]: treesize reduction 103, result has 63.5 percent of original size [2021-06-05 14:50:53,879 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:50:53,879 INFO L247 ElimStorePlain]: Needed 19 recursive calls to eliminate 1 variables, input treesize:751, output treesize:179 [2021-06-05 14:50:54,184 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 14:50:54,184 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367897302] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:50:54,184 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:50:54,184 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:50:54,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921812117] [2021-06-05 14:50:54,185 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:50:54,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:50:54,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:50:54,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:50:54,185 INFO L87 Difference]: Start difference. First operand 336 states and 974 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 14:50:54,769 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2021-06-05 14:50:55,175 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2021-06-05 14:50:55,507 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2021-06-05 14:50:55,645 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2021-06-05 14:50:55,835 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2021-06-05 14:50:55,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:50:55,915 INFO L93 Difference]: Finished difference Result 614 states and 1671 transitions. [2021-06-05 14:50:55,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 14:50:55,916 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 14:50:55,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:50:55,916 INFO L225 Difference]: With dead ends: 614 [2021-06-05 14:50:55,916 INFO L226 Difference]: Without dead ends: 584 [2021-06-05 14:50:55,916 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 2057.5ms TimeCoverageRelationStatistics Valid=171, Invalid=951, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 14:50:55,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2021-06-05 14:50:55,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 336. [2021-06-05 14:50:55,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 2.9074626865671642) internal successors, (974), 335 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:50:55,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 974 transitions. [2021-06-05 14:50:55,921 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 974 transitions. Word has length 20 [2021-06-05 14:50:55,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:50:55,921 INFO L482 AbstractCegarLoop]: Abstraction has 336 states and 974 transitions. [2021-06-05 14:50:55,921 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 14:50:55,921 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 974 transitions. [2021-06-05 14:50:55,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:50:55,921 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:50:55,921 INFO L521 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 14:50:56,121 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 231 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3822 [2021-06-05 14:50:56,121 INFO L430 AbstractCegarLoop]: === Iteration 422 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:50:56,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:50:56,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1536264250, now seen corresponding path program 30 times [2021-06-05 14:50:56,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:50:56,122 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880774642] [2021-06-05 14:50:56,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:50:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:50:56,321 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 14:50:56,322 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:50:56,322 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880774642] [2021-06-05 14:50:56,322 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880774642] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:50:56,322 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966369456] [2021-06-05 14:50:56,322 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 14:50:56,348 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:50:56,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:50:56,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:50:56,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:50:56,732 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:56,732 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:56,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:56,733 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:56,738 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:56,738 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:56,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:56,739 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:56,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:56,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:56,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 31 treesize of output 23 [2021-06-05 14:50:56,744 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:56,749 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:56,749 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:56,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 30 treesize of output 22 [2021-06-05 14:50:56,750 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:56,754 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:56,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:56,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:56,756 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:56,760 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:56,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 14:50:56,761 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:56,998 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2021-06-05 14:50:56,998 INFO L628 ElimStorePlain]: treesize reduction 352, result has 46.6 percent of original size [2021-06-05 14:50:57,002 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:57,002 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:57,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:57,005 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:57,008 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:57,008 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:57,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:57,009 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:57,012 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:57,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 15 treesize of output 11 [2021-06-05 14:50:57,013 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:57,111 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:50:57,115 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:57,115 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:57,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:57,117 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:57,120 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:57,120 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:57,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:50:57,121 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:57,124 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:50:57,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 15 treesize of output 11 [2021-06-05 14:50:57,125 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:50:57,300 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2021-06-05 14:50:57,301 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 14:50:57,306 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 14:50:57,306 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:847, output treesize:239 [2021-06-05 14:50:57,597 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 69 [2021-06-05 14:50:57,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 14:50:57,853 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966369456] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:50:57,853 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:50:57,853 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:50:57,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536226558] [2021-06-05 14:50:57,853 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:50:57,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:50:57,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:50:57,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:50:57,854 INFO L87 Difference]: Start difference. First operand 336 states and 974 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 14:50:58,272 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2021-06-05 14:50:58,550 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2021-06-05 14:50:58,888 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 124 [2021-06-05 14:50:59,447 WARN L205 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 131 [2021-06-05 14:50:59,671 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2021-06-05 14:50:59,955 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2021-06-05 14:50:59,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:50:59,978 INFO L93 Difference]: Finished difference Result 477 states and 1356 transitions. [2021-06-05 14:50:59,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:50:59,978 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 14:50:59,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:50:59,979 INFO L225 Difference]: With dead ends: 477 [2021-06-05 14:50:59,979 INFO L226 Difference]: Without dead ends: 462 [2021-06-05 14:50:59,979 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2521.5ms TimeCoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:50:59,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2021-06-05 14:50:59,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 336. [2021-06-05 14:50:59,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 2.9074626865671642) internal successors, (974), 335 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:50:59,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 974 transitions. [2021-06-05 14:50:59,983 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 974 transitions. Word has length 20 [2021-06-05 14:50:59,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:50:59,983 INFO L482 AbstractCegarLoop]: Abstraction has 336 states and 974 transitions. [2021-06-05 14:50:59,983 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 14:50:59,983 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 974 transitions. [2021-06-05 14:50:59,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:50:59,983 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:50:59,983 INFO L521 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 14:51:00,188 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3852,232 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:51:00,189 INFO L430 AbstractCegarLoop]: === Iteration 423 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:51:00,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:51:00,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1281321126, now seen corresponding path program 31 times [2021-06-05 14:51:00,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:51:00,189 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502007906] [2021-06-05 14:51:00,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:51:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:51:00,588 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 14:51:00,588 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:51:00,588 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502007906] [2021-06-05 14:51:00,588 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502007906] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:51:00,588 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59078519] [2021-06-05 14:51:00,588 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 14:51:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:51:00,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:51:00,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:51:00,851 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:00,852 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:00,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:00,853 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:00,857 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:00,857 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:00,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:00,858 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:00,862 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:00,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 23 treesize of output 17 [2021-06-05 14:51:00,863 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:01,061 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2021-06-05 14:51:01,062 INFO L628 ElimStorePlain]: treesize reduction 140, result has 67.9 percent of original size [2021-06-05 14:51:01,066 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:01,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 15 treesize of output 11 [2021-06-05 14:51:01,067 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:01,161 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:01,165 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:01,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 14:51:01,166 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:01,260 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:01,263 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:01,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:01,264 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:01,359 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:01,362 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:01,363 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:01,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:01,364 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:01,367 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:01,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:01,368 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:01,452 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:01,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:01,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:01,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:01,457 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:01,460 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:01,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:01,461 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:01,533 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:01,538 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 14:51:01,538 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:465, output treesize:193 [2021-06-05 14:51:01,682 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 82 [2021-06-05 14:51:01,847 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2021-06-05 14:51:02,397 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 14:51:02,398 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59078519] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:51:02,398 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:51:02,398 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:51:02,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824281749] [2021-06-05 14:51:02,398 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:51:02,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:51:02,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:51:02,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:51:02,398 INFO L87 Difference]: Start difference. First operand 336 states and 974 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 14:51:02,873 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 112 [2021-06-05 14:51:03,339 WARN L205 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 127 [2021-06-05 14:51:04,101 WARN L205 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 135 [2021-06-05 14:51:04,924 WARN L205 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 142 [2021-06-05 14:51:05,882 WARN L205 SmtUtils]: Spent 890.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 152 [2021-06-05 14:51:06,937 WARN L205 SmtUtils]: Spent 993.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 159 [2021-06-05 14:51:06,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:51:06,967 INFO L93 Difference]: Finished difference Result 622 states and 1708 transitions. [2021-06-05 14:51:06,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:51:06,967 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 14:51:06,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:51:06,968 INFO L225 Difference]: With dead ends: 622 [2021-06-05 14:51:06,968 INFO L226 Difference]: Without dead ends: 607 [2021-06-05 14:51:06,968 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 5250.2ms TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:51:06,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2021-06-05 14:51:06,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 354. [2021-06-05 14:51:06,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 2.903682719546742) internal successors, (1025), 353 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:51:06,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 1025 transitions. [2021-06-05 14:51:06,973 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 1025 transitions. Word has length 20 [2021-06-05 14:51:06,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:51:06,973 INFO L482 AbstractCegarLoop]: Abstraction has 354 states and 1025 transitions. [2021-06-05 14:51:06,973 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 14:51:06,973 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 1025 transitions. [2021-06-05 14:51:06,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:51:06,973 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:51:06,973 INFO L521 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 14:51:07,184 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 233 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3922 [2021-06-05 14:51:07,184 INFO L430 AbstractCegarLoop]: === Iteration 424 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:51:07,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:51:07,184 INFO L82 PathProgramCache]: Analyzing trace with hash 884403472, now seen corresponding path program 32 times [2021-06-05 14:51:07,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:51:07,184 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683234436] [2021-06-05 14:51:07,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:51:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:51:07,649 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 14:51:07,649 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:51:07,649 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683234436] [2021-06-05 14:51:07,649 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683234436] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:51:07,650 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064739875] [2021-06-05 14:51:07,650 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 14:51:07,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:51:07,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:51:07,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:51:07,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:51:07,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 37 treesize of output 27 [2021-06-05 14:51:07,814 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 37 treesize of output 27 [2021-06-05 14:51:07,818 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 29 treesize of output 21 [2021-06-05 14:51:07,822 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 14:51:07,826 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 30 treesize of output 22 [2021-06-05 14:51:07,831 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 36 treesize of output 26 [2021-06-05 14:51:07,835 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 14:51:07,839 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 14:51:07,843 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 38 treesize of output 28 [2021-06-05 14:51:07,848 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 14:51:07,852 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 36 treesize of output 26 [2021-06-05 14:51:07,856 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:07,860 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 31 treesize of output 23 [2021-06-05 14:51:07,864 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:07,869 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 45 treesize of output 33 [2021-06-05 14:51:07,873 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 14:51:07,877 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 30 treesize of output 22 [2021-06-05 14:51:07,881 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 44 treesize of output 32 [2021-06-05 14:51:07,885 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 30 treesize of output 22 [2021-06-05 14:51:07,889 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 44 treesize of output 32 [2021-06-05 14:51:07,893 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 43 treesize of output 31 [2021-06-05 14:51:07,898 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 31 treesize of output 23 [2021-06-05 14:51:07,902 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 37 treesize of output 27 [2021-06-05 14:51:07,906 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 29 treesize of output 21 [2021-06-05 14:51:07,909 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 29 treesize of output 21 [2021-06-05 14:51:07,913 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 30 treesize of output 22 [2021-06-05 14:51:07,917 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 29 treesize of output 21 [2021-06-05 14:51:07,922 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 14:51:07,926 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 37 treesize of output 27 [2021-06-05 14:51:07,930 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 30 treesize of output 22 [2021-06-05 14:51:07,933 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 30 treesize of output 22 [2021-06-05 14:51:07,937 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 37 treesize of output 27 [2021-06-05 14:51:07,941 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 36 treesize of output 26 [2021-06-05 14:51:07,944 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 14:51:07,948 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 31 treesize of output 23 [2021-06-05 14:51:07,952 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:07,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 30 treesize of output 22 [2021-06-05 14:51:07,955 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:08,107 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2021-06-05 14:51:08,107 INFO L628 ElimStorePlain]: treesize reduction 324, result has 38.5 percent of original size [2021-06-05 14:51:08,109 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:51:08,109 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1765, output treesize:203 [2021-06-05 14:51:08,452 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2021-06-05 14:51:08,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 14:51:08,886 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064739875] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:51:08,886 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:51:08,886 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:51:08,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737528449] [2021-06-05 14:51:08,886 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:51:08,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:51:08,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:51:08,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:51:08,886 INFO L87 Difference]: Start difference. First operand 354 states and 1025 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 14:51:09,133 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2021-06-05 14:51:09,545 WARN L205 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2021-06-05 14:51:09,988 WARN L205 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2021-06-05 14:51:10,537 WARN L205 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 87 [2021-06-05 14:51:11,184 WARN L205 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2021-06-05 14:51:11,926 WARN L205 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 104 [2021-06-05 14:51:11,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:51:11,945 INFO L93 Difference]: Finished difference Result 634 states and 1745 transitions. [2021-06-05 14:51:11,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:51:11,945 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 14:51:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:51:11,946 INFO L225 Difference]: With dead ends: 634 [2021-06-05 14:51:11,946 INFO L226 Difference]: Without dead ends: 619 [2021-06-05 14:51:11,946 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 3901.7ms TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:51:11,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2021-06-05 14:51:11,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 354. [2021-06-05 14:51:11,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 2.903682719546742) internal successors, (1025), 353 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:51:11,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 1025 transitions. [2021-06-05 14:51:11,950 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 1025 transitions. Word has length 20 [2021-06-05 14:51:11,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:51:11,950 INFO L482 AbstractCegarLoop]: Abstraction has 354 states and 1025 transitions. [2021-06-05 14:51:11,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 14:51:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 1025 transitions. [2021-06-05 14:51:11,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:51:11,951 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:51:11,951 INFO L521 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 14:51:12,151 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3999,234 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:51:12,151 INFO L430 AbstractCegarLoop]: === Iteration 425 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:51:12,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:51:12,151 INFO L82 PathProgramCache]: Analyzing trace with hash -814316916, now seen corresponding path program 33 times [2021-06-05 14:51:12,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:51:12,152 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126405552] [2021-06-05 14:51:12,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:51:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:51:12,535 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 14:51:12,535 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:51:12,535 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126405552] [2021-06-05 14:51:12,535 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126405552] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:51:12,535 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623980496] [2021-06-05 14:51:12,535 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 14:51:12,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:51:12,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:51:12,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:51:12,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:51:12,787 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:12,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:12,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:12,789 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:12,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:12,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:12,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:12,794 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:12,798 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:12,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 38 treesize of output 28 [2021-06-05 14:51:12,799 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:12,985 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2021-06-05 14:51:12,986 INFO L628 ElimStorePlain]: treesize reduction 98, result has 73.2 percent of original size [2021-06-05 14:51:12,989 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:12,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:12,990 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:13,074 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:13,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:13,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 23 treesize of output 17 [2021-06-05 14:51:13,079 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:13,164 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:13,168 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:13,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 14:51:13,169 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:13,250 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:13,253 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:13,254 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:13,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:13,255 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:13,258 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:13,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 14:51:13,259 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:13,333 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:13,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:13,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:13,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 14:51:13,338 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:13,341 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:13,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 14:51:13,342 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:13,413 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:13,419 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 14:51:13,419 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:465, output treesize:193 [2021-06-05 14:51:13,562 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 82 [2021-06-05 14:51:13,731 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2021-06-05 14:51:14,198 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2021-06-05 14:51:14,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 14:51:14,361 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623980496] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:51:14,361 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:51:14,361 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:51:14,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422302390] [2021-06-05 14:51:14,361 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:51:14,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:51:14,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:51:14,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:51:14,362 INFO L87 Difference]: Start difference. First operand 354 states and 1025 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 14:51:14,877 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 114 [2021-06-05 14:51:15,361 WARN L205 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 134 [2021-06-05 14:51:15,918 WARN L205 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 133 [2021-06-05 14:51:16,700 WARN L205 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 143 [2021-06-05 14:51:17,586 WARN L205 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 148 [2021-06-05 14:51:18,552 WARN L205 SmtUtils]: Spent 901.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 155 [2021-06-05 14:51:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:51:18,579 INFO L93 Difference]: Finished difference Result 641 states and 1761 transitions. [2021-06-05 14:51:18,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:51:18,579 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 14:51:18,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:51:18,580 INFO L225 Difference]: With dead ends: 641 [2021-06-05 14:51:18,580 INFO L226 Difference]: Without dead ends: 626 [2021-06-05 14:51:18,580 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 4867.1ms TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:51:18,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2021-06-05 14:51:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 357. [2021-06-05 14:51:18,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.9101123595505616) internal successors, (1036), 356 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:51:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 1036 transitions. [2021-06-05 14:51:18,584 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 1036 transitions. Word has length 20 [2021-06-05 14:51:18,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:51:18,584 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 1036 transitions. [2021-06-05 14:51:18,584 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 14:51:18,584 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 1036 transitions. [2021-06-05 14:51:18,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:51:18,585 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:51:18,585 INFO L521 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 14:51:18,785 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4027,235 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:51:18,785 INFO L430 AbstractCegarLoop]: === Iteration 426 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:51:18,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:51:18,786 INFO L82 PathProgramCache]: Analyzing trace with hash -987564608, now seen corresponding path program 34 times [2021-06-05 14:51:18,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:51:18,786 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123909069] [2021-06-05 14:51:18,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:51:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:51:19,108 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 14:51:19,109 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:51:19,109 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123909069] [2021-06-05 14:51:19,109 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123909069] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:51:19,109 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065255193] [2021-06-05 14:51:19,109 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 14:51:19,135 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:51:19,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:51:19,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 14:51:19,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:51:19,559 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:19,560 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:19,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 14:51:19,561 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:19,566 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:19,566 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:19,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 14:51:19,567 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:19,571 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:19,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:19,573 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:19,821 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 97 [2021-06-05 14:51:19,821 INFO L628 ElimStorePlain]: treesize reduction 118, result has 74.1 percent of original size [2021-06-05 14:51:19,826 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:19,826 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:19,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 31 treesize of output 23 [2021-06-05 14:51:19,827 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:19,835 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:19,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:19,836 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:19,940 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-06-05 14:51:19,940 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:19,944 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:19,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:19,945 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:20,049 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-06-05 14:51:20,049 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:20,053 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:20,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:20,053 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:20,154 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-05 14:51:20,154 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:20,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:20,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:20,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 14:51:20,159 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:20,163 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:20,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 15 treesize of output 11 [2021-06-05 14:51:20,169 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:20,264 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:20,268 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:20,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 15 treesize of output 11 [2021-06-05 14:51:20,269 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:20,364 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:20,369 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 14:51:20,370 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:537, output treesize:247 [2021-06-05 14:51:20,548 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2021-06-05 14:51:20,763 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2021-06-05 14:51:21,194 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2021-06-05 14:51:21,761 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_757, v_prenex_759, get_6, v_prenex_761, v_prenex_763], 1=[v_prenex_756, get_3, v_prenex_758, v_prenex_760, v_prenex_762]} [2021-06-05 14:51:21,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 30 treesize of output 22 [2021-06-05 14:51:21,769 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:21,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:21,777 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:21,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:21,785 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:21,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 30 treesize of output 22 [2021-06-05 14:51:21,794 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:21,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:21,801 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:21,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:21,808 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:22,170 WARN L205 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 82 [2021-06-05 14:51:22,171 INFO L628 ElimStorePlain]: treesize reduction 1228, result has 20.6 percent of original size [2021-06-05 14:51:22,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:22,175 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:22,276 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-06-05 14:51:22,276 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:22,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:22,281 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:22,379 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:22,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 16 treesize of output 12 [2021-06-05 14:51:22,384 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:22,478 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:22,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 15 treesize of output 11 [2021-06-05 14:51:22,483 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:22,573 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:22,573 INFO L518 ElimStorePlain]: Eliminatee v_prenex_756 vanished before elimination [2021-06-05 14:51:22,573 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 14:51:22,573 INFO L518 ElimStorePlain]: Eliminatee v_prenex_758 vanished before elimination [2021-06-05 14:51:22,573 INFO L518 ElimStorePlain]: Eliminatee v_prenex_760 vanished before elimination [2021-06-05 14:51:22,573 INFO L518 ElimStorePlain]: Eliminatee v_prenex_762 vanished before elimination [2021-06-05 14:51:22,576 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 10 dim-1 vars, End of recursive call: and 12 xjuncts. [2021-06-05 14:51:22,576 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 15 variables, input treesize:1750, output treesize:237 [2021-06-05 14:51:22,752 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2021-06-05 14:51:22,881 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 14:51:22,881 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065255193] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:51:22,881 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:51:22,881 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:51:22,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175799724] [2021-06-05 14:51:22,882 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:51:22,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:51:22,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:51:22,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:51:22,882 INFO L87 Difference]: Start difference. First operand 357 states and 1036 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 14:51:23,502 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 131 [2021-06-05 14:51:24,271 WARN L205 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 143 [2021-06-05 14:51:24,577 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 52 [2021-06-05 14:51:25,369 WARN L205 SmtUtils]: Spent 745.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 146 [2021-06-05 14:51:25,777 WARN L205 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 112 [2021-06-05 14:51:26,883 WARN L205 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 224 DAG size of output: 169 [2021-06-05 14:51:27,241 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 104 [2021-06-05 14:51:28,295 WARN L205 SmtUtils]: Spent 965.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 168 [2021-06-05 14:51:28,551 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 102 [2021-06-05 14:51:29,710 WARN L205 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 220 DAG size of output: 181 [2021-06-05 14:51:29,929 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2021-06-05 14:51:30,108 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2021-06-05 14:51:30,267 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2021-06-05 14:51:30,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:51:30,309 INFO L93 Difference]: Finished difference Result 914 states and 2470 transitions. [2021-06-05 14:51:30,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 14:51:30,310 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 14:51:30,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:51:30,311 INFO L225 Difference]: With dead ends: 914 [2021-06-05 14:51:30,311 INFO L226 Difference]: Without dead ends: 775 [2021-06-05 14:51:30,311 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 8143.7ms TimeCoverageRelationStatistics Valid=217, Invalid=905, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 14:51:30,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2021-06-05 14:51:30,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 386. [2021-06-05 14:51:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 2.9740259740259742) internal successors, (1145), 385 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:51:30,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1145 transitions. [2021-06-05 14:51:30,316 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1145 transitions. Word has length 20 [2021-06-05 14:51:30,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:51:30,316 INFO L482 AbstractCegarLoop]: Abstraction has 386 states and 1145 transitions. [2021-06-05 14:51:30,316 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 14:51:30,316 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1145 transitions. [2021-06-05 14:51:30,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:51:30,317 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:51:30,317 INFO L521 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 14:51:30,517 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4097,236 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:51:30,517 INFO L430 AbstractCegarLoop]: === Iteration 427 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:51:30,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:51:30,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1985393222, now seen corresponding path program 35 times [2021-06-05 14:51:30,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:51:30,518 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933871194] [2021-06-05 14:51:30,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:51:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:51:30,808 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 14:51:30,808 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:51:30,808 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933871194] [2021-06-05 14:51:30,808 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933871194] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:51:30,808 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364119992] [2021-06-05 14:51:30,808 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 14:51:30,835 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:51:30,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:51:30,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:51:30,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:51:30,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:30,944 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:30,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 36 treesize of output 26 [2021-06-05 14:51:30,948 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:30,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 29 treesize of output 21 [2021-06-05 14:51:30,951 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:30,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:30,955 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:30,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 31 treesize of output 23 [2021-06-05 14:51:30,959 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:30,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 14:51:30,963 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:30,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 14:51:30,967 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:30,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 14:51:30,970 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:30,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 38 treesize of output 28 [2021-06-05 14:51:30,974 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:30,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:30,978 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:30,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 38 treesize of output 28 [2021-06-05 14:51:30,982 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:30,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 38 treesize of output 28 [2021-06-05 14:51:30,986 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:30,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 37 treesize of output 27 [2021-06-05 14:51:30,990 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:30,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 30 treesize of output 22 [2021-06-05 14:51:30,993 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:30,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:30,997 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:31,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:31,001 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:31,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 38 treesize of output 28 [2021-06-05 14:51:31,005 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:31,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 14:51:31,008 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:31,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 30 treesize of output 22 [2021-06-05 14:51:31,016 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:31,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 14:51:31,020 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:31,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 14:51:31,023 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:31,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 14:51:31,027 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:31,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:31,030 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:31,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 31 treesize of output 23 [2021-06-05 14:51:31,034 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:31,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:31,037 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:51: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 31 treesize of output 23 [2021-06-05 14:51:31,041 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:31,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:31,045 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:31,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 14:51:31,048 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:31,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 44 treesize of output 32 [2021-06-05 14:51:31,052 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:31,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 37 treesize of output 27 [2021-06-05 14:51:31,055 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:31,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:31,059 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:31,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:31,062 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:31,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:31,065 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:31,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:31,069 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:31,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:31,072 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:31,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 30 treesize of output 22 [2021-06-05 14:51:31,075 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:31,190 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2021-06-05 14:51:31,190 INFO L628 ElimStorePlain]: treesize reduction 268, result has 35.7 percent of original size [2021-06-05 14:51:31,191 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:51:31,191 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1549, output treesize:149 [2021-06-05 14:51:31,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 14:51:31,607 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364119992] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:51:31,607 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:51:31,607 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:51:31,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417792308] [2021-06-05 14:51:31,607 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:51:31,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:51:31,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:51:31,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:51:31,608 INFO L87 Difference]: Start difference. First operand 386 states and 1145 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 14:51:31,997 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2021-06-05 14:51:32,293 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 75 [2021-06-05 14:51:32,640 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 86 [2021-06-05 14:51:32,986 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 96 [2021-06-05 14:51:33,408 WARN L205 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 103 [2021-06-05 14:51:33,922 WARN L205 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 110 [2021-06-05 14:51:33,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:51:33,946 INFO L93 Difference]: Finished difference Result 631 states and 1752 transitions. [2021-06-05 14:51:33,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:51:33,946 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 14:51:33,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:51:33,947 INFO L225 Difference]: With dead ends: 631 [2021-06-05 14:51:33,947 INFO L226 Difference]: Without dead ends: 616 [2021-06-05 14:51:33,947 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2708.7ms TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:51:33,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2021-06-05 14:51:33,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 390. [2021-06-05 14:51:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 2.979434447300771) internal successors, (1159), 389 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:51:33,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1159 transitions. [2021-06-05 14:51:33,952 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1159 transitions. Word has length 20 [2021-06-05 14:51:33,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:51:33,952 INFO L482 AbstractCegarLoop]: Abstraction has 390 states and 1159 transitions. [2021-06-05 14:51:33,952 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 14:51:33,952 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1159 transitions. [2021-06-05 14:51:33,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:51:33,952 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:51:33,953 INFO L521 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 14:51:34,160 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 237 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4353 [2021-06-05 14:51:34,161 INFO L430 AbstractCegarLoop]: === Iteration 428 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:51:34,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:51:34,161 INFO L82 PathProgramCache]: Analyzing trace with hash -809196446, now seen corresponding path program 36 times [2021-06-05 14:51:34,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:51:34,161 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814612636] [2021-06-05 14:51:34,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:51:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:51:34,633 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 14:51:34,633 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:51:34,633 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814612636] [2021-06-05 14:51:34,633 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814612636] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:51:34,633 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367874432] [2021-06-05 14:51:34,633 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 14:51:34,660 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:51:34,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:51:34,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:51:34,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:51:34,894 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:34,894 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:34,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:34,895 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:34,899 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:34,899 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:34,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:34,900 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:34,904 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:34,904 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:34,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:34,905 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:34,909 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:34,909 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:34,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:34,910 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:34,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:34,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:34,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:34,915 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:34,918 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:34,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:34,919 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:35,125 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2021-06-05 14:51:35,126 INFO L628 ElimStorePlain]: treesize reduction 315, result has 47.2 percent of original size [2021-06-05 14:51:35,128 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:35,129 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:35,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 15 treesize of output 11 [2021-06-05 14:51:35,130 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:35,133 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:35,133 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:35,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 15 treesize of output 11 [2021-06-05 14:51:35,134 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:35,136 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:35,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 23 treesize of output 17 [2021-06-05 14:51:35,137 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:35,220 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:35,223 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:35,223 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:35,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:35,224 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:35,227 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:35,227 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:35,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 30 treesize of output 22 [2021-06-05 14:51:35,228 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:35,231 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:35,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 14:51:35,232 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:35,367 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2021-06-05 14:51:35,368 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.5 percent of original size [2021-06-05 14:51:35,373 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 14:51:35,373 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:751, output treesize:183 [2021-06-05 14:51:35,629 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2021-06-05 14:51:36,160 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 14:51:36,160 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367874432] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:51:36,160 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:51:36,160 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:51:36,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953175694] [2021-06-05 14:51:36,160 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:51:36,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:51:36,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:51:36,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:51:36,161 INFO L87 Difference]: Start difference. First operand 390 states and 1159 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 14:51:36,672 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 118 [2021-06-05 14:51:37,170 WARN L205 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 129 [2021-06-05 14:51:37,340 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2021-06-05 14:51:37,592 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2021-06-05 14:51:38,116 WARN L205 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 142 [2021-06-05 14:51:38,348 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 110 [2021-06-05 14:51:38,975 WARN L205 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 156 [2021-06-05 14:51:39,253 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 113 [2021-06-05 14:51:39,564 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2021-06-05 14:51:39,754 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2021-06-05 14:51:40,410 WARN L205 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 165 [2021-06-05 14:51:40,883 WARN L205 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 143 [2021-06-05 14:51:41,217 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 103 [2021-06-05 14:51:42,308 WARN L205 SmtUtils]: Spent 979.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 174 [2021-06-05 14:51:42,910 WARN L205 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 146 [2021-06-05 14:51:43,722 WARN L205 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 188 [2021-06-05 14:51:43,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:51:43,733 INFO L93 Difference]: Finished difference Result 716 states and 2078 transitions. [2021-06-05 14:51:43,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 14:51:43,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 14:51:43,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:51:43,734 INFO L225 Difference]: With dead ends: 716 [2021-06-05 14:51:43,734 INFO L226 Difference]: Without dead ends: 701 [2021-06-05 14:51:43,734 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 7849.2ms TimeCoverageRelationStatistics Valid=265, Invalid=1067, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 14:51:43,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2021-06-05 14:51:43,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 394. [2021-06-05 14:51:43,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 2.989821882951654) internal successors, (1175), 393 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:51:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1175 transitions. [2021-06-05 14:51:43,739 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1175 transitions. Word has length 20 [2021-06-05 14:51:43,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:51:43,739 INFO L482 AbstractCegarLoop]: Abstraction has 394 states and 1175 transitions. [2021-06-05 14:51:43,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 14:51:43,740 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1175 transitions. [2021-06-05 14:51:43,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:51:43,740 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:51:43,740 INFO L521 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 14:51:43,942 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4378,238 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:51:43,942 INFO L430 AbstractCegarLoop]: === Iteration 429 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:51:43,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:51:43,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1859986214, now seen corresponding path program 37 times [2021-06-05 14:51:43,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:51:43,942 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068095134] [2021-06-05 14:51:43,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:51:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:51:44,204 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 14:51:44,204 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:51:44,204 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068095134] [2021-06-05 14:51:44,204 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068095134] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:51:44,204 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963183584] [2021-06-05 14:51:44,204 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 14:51:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:51:44,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:51:44,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:51:44,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:44,331 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,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 14:51:44,335 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,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 37 treesize of output 27 [2021-06-05 14:51:44,338 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,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 36 treesize of output 26 [2021-06-05 14:51:44,342 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,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 31 treesize of output 23 [2021-06-05 14:51:44,346 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:44,350 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:44,354 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:44,358 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,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 30 treesize of output 22 [2021-06-05 14:51:44,361 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:44,365 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,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 30 treesize of output 22 [2021-06-05 14:51:44,369 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,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 14:51:44,372 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:44,376 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,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 14:51:44,380 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,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 14:51:44,383 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,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 38 treesize of output 28 [2021-06-05 14:51:44,387 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,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 31 treesize of output 23 [2021-06-05 14:51:44,391 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:44,395 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,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 37 treesize of output 27 [2021-06-05 14:51:44,398 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,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 30 treesize of output 22 [2021-06-05 14:51:44,402 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:44,406 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:44,415 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,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 37 treesize of output 27 [2021-06-05 14:51:44,419 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:44,422 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,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 29 treesize of output 21 [2021-06-05 14:51:44,426 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:44,429 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,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 44 treesize of output 32 [2021-06-05 14:51:44,433 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:44,436 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:44,439 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,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 43 treesize of output 31 [2021-06-05 14:51:44,443 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:44,446 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,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 36 treesize of output 26 [2021-06-05 14:51:44,449 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,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 14:51:44,453 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,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 37 treesize of output 27 [2021-06-05 14:51:44,456 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:51:44,459 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,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 44 treesize of output 32 [2021-06-05 14:51:44,462 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:44,568 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2021-06-05 14:51:44,568 INFO L628 ElimStorePlain]: treesize reduction 258, result has 36.6 percent of original size [2021-06-05 14:51:44,569 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:51:44,569 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1549, output treesize:149 [2021-06-05 14:51:45,011 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 14:51:45,011 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963183584] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:51:45,011 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:51:45,011 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:51:45,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375779903] [2021-06-05 14:51:45,011 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:51:45,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:51:45,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:51:45,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:51:45,011 INFO L87 Difference]: Start difference. First operand 394 states and 1175 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 14:51:45,395 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2021-06-05 14:51:45,700 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2021-06-05 14:51:46,024 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 77 [2021-06-05 14:51:46,511 WARN L205 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 91 [2021-06-05 14:51:47,287 WARN L205 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 101 [2021-06-05 14:51:48,118 WARN L205 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 104 [2021-06-05 14:51:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:51:48,139 INFO L93 Difference]: Finished difference Result 635 states and 1768 transitions. [2021-06-05 14:51:48,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:51:48,139 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 14:51:48,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:51:48,140 INFO L225 Difference]: With dead ends: 635 [2021-06-05 14:51:48,140 INFO L226 Difference]: Without dead ends: 620 [2021-06-05 14:51:48,140 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 3464.9ms TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:51:48,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2021-06-05 14:51:48,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 394. [2021-06-05 14:51:48,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 2.989821882951654) internal successors, (1175), 393 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:51:48,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1175 transitions. [2021-06-05 14:51:48,145 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1175 transitions. Word has length 20 [2021-06-05 14:51:48,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:51:48,145 INFO L482 AbstractCegarLoop]: Abstraction has 394 states and 1175 transitions. [2021-06-05 14:51:48,145 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 14:51:48,145 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1175 transitions. [2021-06-05 14:51:48,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:51:48,145 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:51:48,145 INFO L521 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 14:51:48,346 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 239 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4481 [2021-06-05 14:51:48,346 INFO L430 AbstractCegarLoop]: === Iteration 430 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:51:48,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:51:48,347 INFO L82 PathProgramCache]: Analyzing trace with hash 246419480, now seen corresponding path program 38 times [2021-06-05 14:51:48,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:51:48,347 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969445406] [2021-06-05 14:51:48,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:51:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:51:48,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 14:51:48,729 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:51:48,729 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969445406] [2021-06-05 14:51:48,729 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969445406] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:51:48,729 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868498187] [2021-06-05 14:51:48,729 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 14:51:48,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:51:48,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:51:48,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:51:48,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:51:48,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 37 treesize of output 27 [2021-06-05 14:51:48,862 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 37 treesize of output 27 [2021-06-05 14:51:48,867 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 29 treesize of output 21 [2021-06-05 14:51:48,871 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 31 treesize of output 23 [2021-06-05 14:51:48,875 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 14:51:48,880 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 36 treesize of output 26 [2021-06-05 14:51:48,884 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 14:51:48,889 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 14:51:48,893 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 38 treesize of output 28 [2021-06-05 14:51:48,897 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 30 treesize of output 22 [2021-06-05 14:51:48,901 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 36 treesize of output 26 [2021-06-05 14:51:48,906 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 14:51:48,910 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 14:51:48,914 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 36 treesize of output 26 [2021-06-05 14:51:48,918 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 45 treesize of output 33 [2021-06-05 14:51:48,922 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 14:51:48,926 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 30 treesize of output 22 [2021-06-05 14:51:48,930 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 44 treesize of output 32 [2021-06-05 14:51:48,934 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 30 treesize of output 22 [2021-06-05 14:51:48,938 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 44 treesize of output 32 [2021-06-05 14:51:48,942 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 43 treesize of output 31 [2021-06-05 14:51:48,946 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 31 treesize of output 23 [2021-06-05 14:51:48,950 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 37 treesize of output 27 [2021-06-05 14:51:48,954 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 29 treesize of output 21 [2021-06-05 14:51:48,958 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 29 treesize of output 21 [2021-06-05 14:51:48,962 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 14:51:48,966 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 14:51:48,969 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 38 treesize of output 28 [2021-06-05 14:51:48,973 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 37 treesize of output 27 [2021-06-05 14:51:48,977 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 30 treesize of output 22 [2021-06-05 14:51:48,980 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 30 treesize of output 22 [2021-06-05 14:51:48,984 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 37 treesize of output 27 [2021-06-05 14:51:48,987 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 36 treesize of output 26 [2021-06-05 14:51:48,991 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 37 treesize of output 27 [2021-06-05 14:51:48,995 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:48,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 31 treesize of output 23 [2021-06-05 14:51:48,998 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:49,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 14:51:49,002 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:49,146 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2021-06-05 14:51:49,147 INFO L628 ElimStorePlain]: treesize reduction 324, result has 38.5 percent of original size [2021-06-05 14:51:49,148 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:51:49,148 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1765, output treesize:203 [2021-06-05 14:51:49,621 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2021-06-05 14:51:49,765 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2021-06-05 14:51:49,871 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 14:51:49,872 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868498187] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:51:49,872 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:51:49,872 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:51:49,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765189516] [2021-06-05 14:51:49,872 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:51:49,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:51:49,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:51:49,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:51:49,872 INFO L87 Difference]: Start difference. First operand 394 states and 1175 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 14:51:50,090 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2021-06-05 14:51:50,452 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2021-06-05 14:51:50,832 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2021-06-05 14:51:51,317 WARN L205 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2021-06-05 14:51:51,864 WARN L205 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2021-06-05 14:51:52,511 WARN L205 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2021-06-05 14:51:52,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:51:52,525 INFO L93 Difference]: Finished difference Result 604 states and 1705 transitions. [2021-06-05 14:51:52,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:51:52,525 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 14:51:52,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:51:52,526 INFO L225 Difference]: With dead ends: 604 [2021-06-05 14:51:52,526 INFO L226 Difference]: Without dead ends: 589 [2021-06-05 14:51:52,526 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 3472.4ms TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:51:52,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-06-05 14:51:52,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 394. [2021-06-05 14:51:52,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 2.989821882951654) internal successors, (1175), 393 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:51:52,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1175 transitions. [2021-06-05 14:51:52,530 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1175 transitions. Word has length 20 [2021-06-05 14:51:52,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:51:52,530 INFO L482 AbstractCegarLoop]: Abstraction has 394 states and 1175 transitions. [2021-06-05 14:51:52,530 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 14:51:52,531 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1175 transitions. [2021-06-05 14:51:52,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:51:52,531 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:51:52,531 INFO L521 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 14:51:52,740 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 240 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4505 [2021-06-05 14:51:52,741 INFO L430 AbstractCegarLoop]: === Iteration 431 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:51:52,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:51:52,741 INFO L82 PathProgramCache]: Analyzing trace with hash -492920346, now seen corresponding path program 39 times [2021-06-05 14:51:52,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:51:52,741 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237509499] [2021-06-05 14:51:52,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:51:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:51:53,158 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 14:51:53,158 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:51:53,158 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237509499] [2021-06-05 14:51:53,158 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237509499] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:51:53,158 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358531209] [2021-06-05 14:51:53,158 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 14:51:53,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:51:53,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:51:53,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:51:53,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:51:53,438 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:53,439 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:53,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 22 treesize of output 16 [2021-06-05 14:51:53,439 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:53,443 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:53,443 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:53,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 30 treesize of output 22 [2021-06-05 14:51:53,444 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:53,448 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:53,448 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:53,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 14:51:53,449 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:53,452 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:53,453 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:53,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 23 treesize of output 17 [2021-06-05 14:51:53,453 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:53,457 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:53,457 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:53,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:53,458 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:53,461 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:53,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:53,462 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:53,689 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2021-06-05 14:51:53,690 INFO L628 ElimStorePlain]: treesize reduction 321, result has 46.8 percent of original size [2021-06-05 14:51:53,693 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:53,693 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:53,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 14:51:53,694 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:53,697 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:53,698 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:53,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 15 treesize of output 11 [2021-06-05 14:51:53,698 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:53,701 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:53,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 14:51:53,702 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:53,794 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:53,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:53,798 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:53,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 23 treesize of output 17 [2021-06-05 14:51:53,799 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:53,802 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:53,802 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:53,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 30 treesize of output 22 [2021-06-05 14:51:53,803 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:53,806 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:53,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:53,807 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:53,961 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2021-06-05 14:51:53,961 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.5 percent of original size [2021-06-05 14:51:53,967 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 14:51:53,967 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:751, output treesize:183 [2021-06-05 14:51:54,714 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 14:51:54,714 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358531209] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:51:54,714 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:51:54,714 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:51:54,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439792711] [2021-06-05 14:51:54,714 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:51:54,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:51:54,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:51:54,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:51:54,722 INFO L87 Difference]: Start difference. First operand 394 states and 1175 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 14:51:55,249 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 112 [2021-06-05 14:51:55,661 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 116 [2021-06-05 14:51:56,073 WARN L205 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 135 [2021-06-05 14:51:56,632 WARN L205 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 146 [2021-06-05 14:51:57,495 WARN L205 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 156 [2021-06-05 14:51:58,420 WARN L205 SmtUtils]: Spent 857.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 164 [2021-06-05 14:51:58,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:51:58,438 INFO L93 Difference]: Finished difference Result 678 states and 1882 transitions. [2021-06-05 14:51:58,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:51:58,438 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 14:51:58,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:51:58,439 INFO L225 Difference]: With dead ends: 678 [2021-06-05 14:51:58,439 INFO L226 Difference]: Without dead ends: 657 [2021-06-05 14:51:58,439 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 4268.6ms TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:51:58,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2021-06-05 14:51:58,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 398. [2021-06-05 14:51:58,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 3.005037783375315) internal successors, (1193), 397 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:51:58,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1193 transitions. [2021-06-05 14:51:58,444 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1193 transitions. Word has length 20 [2021-06-05 14:51:58,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:51:58,444 INFO L482 AbstractCegarLoop]: Abstraction has 398 states and 1193 transitions. [2021-06-05 14:51:58,444 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 14:51:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1193 transitions. [2021-06-05 14:51:58,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:51:58,444 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:51:58,444 INFO L521 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 14:51:58,645 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4533,241 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:51:58,645 INFO L430 AbstractCegarLoop]: === Iteration 432 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:51:58,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:51:58,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1711555706, now seen corresponding path program 40 times [2021-06-05 14:51:58,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:51:58,645 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091079766] [2021-06-05 14:51:58,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:51:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:51:59,064 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 14:51:59,065 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:51:59,065 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091079766] [2021-06-05 14:51:59,065 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091079766] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:51:59,065 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037603017] [2021-06-05 14:51:59,065 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 14:51:59,090 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:51:59,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:51:59,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:51:59,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:51:59,331 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:59,332 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:59,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:59,333 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:59,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:59,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:59,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:59,338 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:59,342 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:59,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:59,343 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:59,536 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2021-06-05 14:51:59,536 INFO L628 ElimStorePlain]: treesize reduction 106, result has 72.8 percent of original size [2021-06-05 14:51:59,540 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:59,540 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:59,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 23 treesize of output 17 [2021-06-05 14:51:59,541 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:59,545 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:59,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 14:51:59,545 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:59,633 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:59,637 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:59,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:59,638 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:59,723 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:59,726 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:59,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 15 treesize of output 11 [2021-06-05 14:51:59,727 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:59,810 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:59,813 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:59,814 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:59,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:59,815 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:59,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:59,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:59,819 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:59,891 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:59,894 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:51:59,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:51:59,895 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:51:59,967 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:51:59,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 14:51:59,972 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:465, output treesize:193 [2021-06-05 14:52:00,122 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 82 [2021-06-05 14:52:00,557 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2021-06-05 14:52:00,718 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2021-06-05 14:52:00,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 14:52:00,877 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037603017] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:52:00,877 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:52:00,877 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:52:00,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615788186] [2021-06-05 14:52:00,878 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:52:00,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:52:00,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:52:00,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:52:00,878 INFO L87 Difference]: Start difference. First operand 398 states and 1193 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 14:52:01,430 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 127 [2021-06-05 14:52:02,108 WARN L205 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 129 [2021-06-05 14:52:02,272 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2021-06-05 14:52:02,838 WARN L205 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 139 [2021-06-05 14:52:03,592 WARN L205 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 147 [2021-06-05 14:52:04,403 WARN L205 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 153 [2021-06-05 14:52:05,269 WARN L205 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 164 [2021-06-05 14:52:06,054 WARN L205 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 157 [2021-06-05 14:52:06,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:52:06,066 INFO L93 Difference]: Finished difference Result 702 states and 1979 transitions. [2021-06-05 14:52:06,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 14:52:06,066 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 14:52:06,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:52:06,067 INFO L225 Difference]: With dead ends: 702 [2021-06-05 14:52:06,067 INFO L226 Difference]: Without dead ends: 687 [2021-06-05 14:52:06,067 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 5733.5ms TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2021-06-05 14:52:06,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2021-06-05 14:52:06,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 398. [2021-06-05 14:52:06,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 3.005037783375315) internal successors, (1193), 397 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:52:06,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1193 transitions. [2021-06-05 14:52:06,072 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1193 transitions. Word has length 20 [2021-06-05 14:52:06,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:52:06,072 INFO L482 AbstractCegarLoop]: Abstraction has 398 states and 1193 transitions. [2021-06-05 14:52:06,072 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 14:52:06,072 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1193 transitions. [2021-06-05 14:52:06,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:52:06,073 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:52:06,073 INFO L521 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 14:52:06,273 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4638,242 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:52:06,273 INFO L430 AbstractCegarLoop]: === Iteration 433 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:52:06,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:52:06,273 INFO L82 PathProgramCache]: Analyzing trace with hash 496140202, now seen corresponding path program 41 times [2021-06-05 14:52:06,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:52:06,273 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901193484] [2021-06-05 14:52:06,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:52:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:52:06,456 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 14:52:06,456 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:52:06,456 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901193484] [2021-06-05 14:52:06,456 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901193484] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:52:06,456 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69452802] [2021-06-05 14:52:06,456 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 14:52:06,482 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:52:06,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:52:06,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:52:06,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:52:06,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:06,598 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:06,602 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:06,605 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,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 14:52:06,609 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,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 36 treesize of output 26 [2021-06-05 14:52:06,613 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,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 37 treesize of output 27 [2021-06-05 14:52:06,617 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,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 30 treesize of output 22 [2021-06-05 14:52:06,620 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,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 37 treesize of output 27 [2021-06-05 14:52:06,624 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,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 37 treesize of output 27 [2021-06-05 14:52:06,628 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,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 29 treesize of output 21 [2021-06-05 14:52:06,632 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,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 14:52:06,636 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:06,640 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:06,644 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,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 14:52:06,648 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,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 38 treesize of output 28 [2021-06-05 14:52:06,652 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,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 29 treesize of output 21 [2021-06-05 14:52:06,655 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:06,659 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:06,663 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,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 14:52:06,667 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,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 30 treesize of output 22 [2021-06-05 14:52:06,670 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,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 30 treesize of output 22 [2021-06-05 14:52:06,675 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,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 37 treesize of output 27 [2021-06-05 14:52:06,678 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:06,682 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,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 36 treesize of output 26 [2021-06-05 14:52:06,686 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:06,693 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,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 30 treesize of output 22 [2021-06-05 14:52:06,697 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,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 44 treesize of output 32 [2021-06-05 14:52:06,701 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:06,705 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,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 43 treesize of output 31 [2021-06-05 14:52:06,708 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,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 30 treesize of output 22 [2021-06-05 14:52:06,712 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,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 36 treesize of output 26 [2021-06-05 14:52:06,715 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:06,719 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,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 37 treesize of output 27 [2021-06-05 14:52:06,723 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:06,727 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:06,730 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,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 14:52:06,733 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:06,867 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2021-06-05 14:52:06,867 INFO L628 ElimStorePlain]: treesize reduction 248, result has 37.5 percent of original size [2021-06-05 14:52:06,868 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:52:06,868 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1549, output treesize:149 [2021-06-05 14:52:07,287 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2021-06-05 14:52:07,440 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 14:52:07,440 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69452802] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:52:07,440 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:52:07,440 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:52:07,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796836010] [2021-06-05 14:52:07,440 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:52:07,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:52:07,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:52:07,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:52:07,441 INFO L87 Difference]: Start difference. First operand 398 states and 1193 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 14:52:07,635 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2021-06-05 14:52:07,998 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2021-06-05 14:52:08,585 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2021-06-05 14:52:09,027 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2021-06-05 14:52:09,235 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2021-06-05 14:52:09,577 WARN L205 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 90 [2021-06-05 14:52:09,807 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2021-06-05 14:52:10,472 WARN L205 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 96 [2021-06-05 14:52:10,699 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2021-06-05 14:52:10,927 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2021-06-05 14:52:11,170 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2021-06-05 14:52:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:52:11,171 INFO L93 Difference]: Finished difference Result 952 states and 2582 transitions. [2021-06-05 14:52:11,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 14:52:11,171 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 14:52:11,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:52:11,173 INFO L225 Difference]: With dead ends: 952 [2021-06-05 14:52:11,173 INFO L226 Difference]: Without dead ends: 916 [2021-06-05 14:52:11,173 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 4104.2ms TimeCoverageRelationStatistics Valid=243, Invalid=1163, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 14:52:11,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2021-06-05 14:52:11,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 405. [2021-06-05 14:52:11,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 3.032178217821782) internal successors, (1225), 404 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:52:11,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1225 transitions. [2021-06-05 14:52:11,179 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1225 transitions. Word has length 20 [2021-06-05 14:52:11,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:52:11,179 INFO L482 AbstractCegarLoop]: Abstraction has 405 states and 1225 transitions. [2021-06-05 14:52:11,179 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 14:52:11,179 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1225 transitions. [2021-06-05 14:52:11,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:52:11,179 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:52:11,179 INFO L521 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 14:52:11,379 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 243 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4709 [2021-06-05 14:52:11,380 INFO L430 AbstractCegarLoop]: === Iteration 434 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:52:11,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:52:11,380 INFO L82 PathProgramCache]: Analyzing trace with hash -674048794, now seen corresponding path program 42 times [2021-06-05 14:52:11,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:52:11,380 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116724033] [2021-06-05 14:52:11,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:52:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:52:11,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 14:52:11,705 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:52:11,705 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116724033] [2021-06-05 14:52:11,705 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116724033] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:52:11,705 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130396504] [2021-06-05 14:52:11,705 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 14:52:11,730 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:52:11,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:52:11,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 14:52:11,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:52:12,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:12,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:12,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 30 treesize of output 22 [2021-06-05 14:52:12,176 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:12,181 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:12,181 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:12,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 22 treesize of output 16 [2021-06-05 14:52:12,182 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:12,186 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:12,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:12,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 14:52:12,187 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:12,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:12,193 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:12,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:12,193 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:12,197 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:12,198 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:12,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:12,199 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:12,203 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:12,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:12,204 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:12,507 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2021-06-05 14:52:12,508 INFO L628 ElimStorePlain]: treesize reduction 391, result has 49.8 percent of original size [2021-06-05 14:52:12,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:12,512 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:12,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 31 treesize of output 23 [2021-06-05 14:52:12,513 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:12,516 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:12,517 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:12,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:12,518 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:12,521 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:12,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:12,522 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:12,758 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2021-06-05 14:52:12,758 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.7 percent of original size [2021-06-05 14:52:12,761 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:12,762 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:12,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 14:52:12,763 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:12,766 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:12,766 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:12,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:12,767 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:12,770 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:12,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:12,771 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:12,882 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2021-06-05 14:52:12,882 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:12,888 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 14:52:12,888 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:949, output treesize:295 [2021-06-05 14:52:13,086 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2021-06-05 14:52:13,258 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-06-05 14:52:13,476 INFO L446 ElimStorePlain]: Different costs {0=[get_6, v_prenex_841, v_prenex_831, v_prenex_843, v_prenex_821, v_prenex_833, v_prenex_823, v_prenex_835, v_prenex_846, v_prenex_825, v_prenex_837, v_prenex_827, v_prenex_839, v_prenex_829], 1=[get_3, v_prenex_840, v_prenex_830, v_prenex_842, v_prenex_820, v_prenex_832, v_prenex_822, v_prenex_834, v_prenex_845, v_prenex_824, v_prenex_836, v_prenex_826, v_prenex_838, v_prenex_828]} [2021-06-05 14:52:13,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:13,488 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:14,020 WARN L205 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 114 [2021-06-05 14:52:14,021 INFO L628 ElimStorePlain]: treesize reduction 1223, result has 24.4 percent of original size [2021-06-05 14:52:14,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 9 treesize of output 7 [2021-06-05 14:52:14,026 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:14,174 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-05 14:52:14,175 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:14,175 INFO L518 ElimStorePlain]: Eliminatee v_prenex_831 vanished before elimination [2021-06-05 14:52:14,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 7 treesize of output 5 [2021-06-05 14:52:14,180 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:14,326 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-06-05 14:52:14,326 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:14,326 INFO L518 ElimStorePlain]: Eliminatee v_prenex_821 vanished before elimination [2021-06-05 14:52:14,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:14,332 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:14,477 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-06-05 14:52:14,477 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:14,477 INFO L518 ElimStorePlain]: Eliminatee v_prenex_823 vanished before elimination [2021-06-05 14:52:14,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 7 treesize of output 5 [2021-06-05 14:52:14,483 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:14,628 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-06-05 14:52:14,628 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:14,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 7 treesize of output 5 [2021-06-05 14:52:14,633 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:14,773 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-06-05 14:52:14,773 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:14,774 INFO L518 ElimStorePlain]: Eliminatee v_prenex_825 vanished before elimination [2021-06-05 14:52:14,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:14,778 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:14,920 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 14:52:14,920 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:14,920 INFO L518 ElimStorePlain]: Eliminatee v_prenex_827 vanished before elimination [2021-06-05 14:52:14,920 INFO L518 ElimStorePlain]: Eliminatee v_prenex_839 vanished before elimination [2021-06-05 14:52:14,920 INFO L518 ElimStorePlain]: Eliminatee v_prenex_829 vanished before elimination [2021-06-05 14:52:14,920 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 14:52:14,920 INFO L518 ElimStorePlain]: Eliminatee v_prenex_840 vanished before elimination [2021-06-05 14:52:14,920 INFO L518 ElimStorePlain]: Eliminatee v_prenex_830 vanished before elimination [2021-06-05 14:52:14,920 INFO L518 ElimStorePlain]: Eliminatee v_prenex_842 vanished before elimination [2021-06-05 14:52:14,920 INFO L518 ElimStorePlain]: Eliminatee v_prenex_820 vanished before elimination [2021-06-05 14:52:14,921 INFO L518 ElimStorePlain]: Eliminatee v_prenex_832 vanished before elimination [2021-06-05 14:52:14,921 INFO L518 ElimStorePlain]: Eliminatee v_prenex_822 vanished before elimination [2021-06-05 14:52:14,921 INFO L518 ElimStorePlain]: Eliminatee v_prenex_834 vanished before elimination [2021-06-05 14:52:14,921 INFO L518 ElimStorePlain]: Eliminatee v_prenex_845 vanished before elimination [2021-06-05 14:52:14,921 INFO L518 ElimStorePlain]: Eliminatee v_prenex_824 vanished before elimination [2021-06-05 14:52:14,921 INFO L518 ElimStorePlain]: Eliminatee v_prenex_836 vanished before elimination [2021-06-05 14:52:14,921 INFO L518 ElimStorePlain]: Eliminatee v_prenex_826 vanished before elimination [2021-06-05 14:52:14,921 INFO L518 ElimStorePlain]: Eliminatee v_prenex_838 vanished before elimination [2021-06-05 14:52:14,921 INFO L518 ElimStorePlain]: Eliminatee v_prenex_828 vanished before elimination [2021-06-05 14:52:14,925 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 14:52:14,925 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 42 variables, input treesize:1625, output treesize:328 [2021-06-05 14:52:15,176 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2021-06-05 14:52:15,566 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2021-06-05 14:52:15,787 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2021-06-05 14:52:15,905 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 14:52:15,906 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130396504] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:52:15,906 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:52:15,906 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:52:15,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018979658] [2021-06-05 14:52:15,906 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:52:15,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:52:15,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:52:15,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:52:15,906 INFO L87 Difference]: Start difference. First operand 405 states and 1225 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 14:52:16,256 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 123 [2021-06-05 14:52:16,658 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 127 [2021-06-05 14:52:17,212 WARN L205 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 139 [2021-06-05 14:52:17,964 WARN L205 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 151 [2021-06-05 14:52:18,956 WARN L205 SmtUtils]: Spent 920.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 155 [2021-06-05 14:52:20,026 WARN L205 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 196 DAG size of output: 162 [2021-06-05 14:52:20,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:52:20,058 INFO L93 Difference]: Finished difference Result 700 states and 1958 transitions. [2021-06-05 14:52:20,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:52:20,058 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 14:52:20,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:52:20,059 INFO L225 Difference]: With dead ends: 700 [2021-06-05 14:52:20,059 INFO L226 Difference]: Without dead ends: 685 [2021-06-05 14:52:20,059 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 5318.5ms TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:52:20,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2021-06-05 14:52:20,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 402. [2021-06-05 14:52:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 3.027431421446384) internal successors, (1214), 401 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:52:20,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1214 transitions. [2021-06-05 14:52:20,064 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1214 transitions. Word has length 20 [2021-06-05 14:52:20,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:52:20,064 INFO L482 AbstractCegarLoop]: Abstraction has 402 states and 1214 transitions. [2021-06-05 14:52:20,064 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 14:52:20,064 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1214 transitions. [2021-06-05 14:52:20,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:52:20,065 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:52:20,065 INFO L521 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 14:52:20,265 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4736,244 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:52:20,265 INFO L430 AbstractCegarLoop]: === Iteration 435 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:52:20,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:52:20,265 INFO L82 PathProgramCache]: Analyzing trace with hash -690985846, now seen corresponding path program 43 times [2021-06-05 14:52:20,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:52:20,266 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744368517] [2021-06-05 14:52:20,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:52:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:52: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 14:52:20,651 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:52:20,651 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744368517] [2021-06-05 14:52:20,651 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744368517] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:52:20,651 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451880130] [2021-06-05 14:52:20,651 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 14:52:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:52:20,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:52:20,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:52:20,929 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:20,930 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52: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 30 treesize of output 22 [2021-06-05 14:52:20,931 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:20,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:20,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:20,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 14:52:20,936 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:20,941 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:20,941 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:20,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 22 treesize of output 16 [2021-06-05 14:52:20,942 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:20,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:20,946 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:20,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:20,947 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:20,950 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:20,950 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:20,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 22 treesize of output 16 [2021-06-05 14:52:20,960 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:20,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:20,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:20,966 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:21,199 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2021-06-05 14:52:21,199 INFO L628 ElimStorePlain]: treesize reduction 354, result has 45.5 percent of original size [2021-06-05 14:52:21,202 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:21,202 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:21,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:21,203 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:21,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:21,207 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:21,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:21,208 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:21,211 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:21,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:21,212 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:21,384 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2021-06-05 14:52:21,384 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 14:52:21,387 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:21,388 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:21,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:21,389 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:21,391 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:21,392 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:21,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:21,393 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:21,395 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:21,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:21,396 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:21,530 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2021-06-05 14:52:21,530 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.5 percent of original size [2021-06-05 14:52:21,535 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 14:52:21,535 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:751, output treesize:183 [2021-06-05 14:52:22,343 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 14:52:22,344 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451880130] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:52:22,344 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:52:22,344 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:52:22,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890567330] [2021-06-05 14:52:22,344 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:52:22,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:52:22,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:52:22,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:52:22,344 INFO L87 Difference]: Start difference. First operand 402 states and 1214 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 14:52:22,987 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2021-06-05 14:52:23,141 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2021-06-05 14:52:23,429 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-06-05 14:52:23,597 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2021-06-05 14:52:24,121 WARN L205 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 122 [2021-06-05 14:52:24,357 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2021-06-05 14:52:24,925 WARN L205 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 134 [2021-06-05 14:52:25,179 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2021-06-05 14:52:25,788 WARN L205 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 136 [2021-06-05 14:52:26,050 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2021-06-05 14:52:26,332 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2021-06-05 14:52:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:52:26,333 INFO L93 Difference]: Finished difference Result 957 states and 2592 transitions. [2021-06-05 14:52:26,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 14:52:26,334 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 14:52:26,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:52:26,335 INFO L225 Difference]: With dead ends: 957 [2021-06-05 14:52:26,335 INFO L226 Difference]: Without dead ends: 919 [2021-06-05 14:52:26,335 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 4461.8ms TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 14:52:26,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2021-06-05 14:52:26,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 404. [2021-06-05 14:52:26,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 403 states have (on average 3.029776674937965) internal successors, (1221), 403 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:52:26,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1221 transitions. [2021-06-05 14:52:26,341 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1221 transitions. Word has length 20 [2021-06-05 14:52:26,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:52:26,341 INFO L482 AbstractCegarLoop]: Abstraction has 404 states and 1221 transitions. [2021-06-05 14:52:26,341 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 14:52:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1221 transitions. [2021-06-05 14:52:26,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:52:26,341 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:52:26,341 INFO L521 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 14:52:26,541 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 245 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4878 [2021-06-05 14:52:26,542 INFO L430 AbstractCegarLoop]: === Iteration 436 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:52:26,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:52:26,542 INFO L82 PathProgramCache]: Analyzing trace with hash 449297990, now seen corresponding path program 44 times [2021-06-05 14:52:26,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:52:26,542 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101101516] [2021-06-05 14:52:26,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:52:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:52:26,894 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 14:52:26,895 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:52:26,895 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101101516] [2021-06-05 14:52:26,895 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101101516] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:52:26,895 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608611882] [2021-06-05 14:52:26,895 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 14:52:26,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:52:26,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:52:26,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:52:26,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:52:27,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:27,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:27,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 23 treesize of output 17 [2021-06-05 14:52:27,177 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:27,180 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:27,181 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:27,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 29 treesize of output 21 [2021-06-05 14:52:27,182 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:27,186 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:27,186 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:27,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 22 treesize of output 16 [2021-06-05 14:52:27,187 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:27,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:27,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:27,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 30 treesize of output 22 [2021-06-05 14:52:27,191 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:27,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:27,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:27,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:27,196 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:27,199 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:27,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 22 treesize of output 16 [2021-06-05 14:52:27,200 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:27,408 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2021-06-05 14:52:27,408 INFO L628 ElimStorePlain]: treesize reduction 317, result has 47.1 percent of original size [2021-06-05 14:52:27,411 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:27,411 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:27,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:27,412 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:27,415 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:27,415 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:27,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:27,416 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:27,419 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:27,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:27,420 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:27,504 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:27,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:27,508 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:27,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 30 treesize of output 22 [2021-06-05 14:52:27,509 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:27,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:27,512 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:27,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 23 treesize of output 17 [2021-06-05 14:52:27,513 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:27,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:27,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:27,516 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:27,648 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2021-06-05 14:52:27,648 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.5 percent of original size [2021-06-05 14:52:27,653 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 14:52:27,654 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:751, output treesize:183 [2021-06-05 14:52:28,393 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 14:52:28,393 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608611882] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:52:28,393 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:52:28,394 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:52:28,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527563042] [2021-06-05 14:52:28,394 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:52:28,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:52:28,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:52:28,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:52:28,394 INFO L87 Difference]: Start difference. First operand 404 states and 1221 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 14:52:28,886 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 112 [2021-06-05 14:52:29,277 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 116 [2021-06-05 14:52:29,639 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 127 [2021-06-05 14:52:30,307 WARN L205 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 135 [2021-06-05 14:52:31,000 WARN L205 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 145 [2021-06-05 14:52:31,745 WARN L205 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 152 [2021-06-05 14:52:31,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:52:31,774 INFO L93 Difference]: Finished difference Result 705 states and 1969 transitions. [2021-06-05 14:52:31,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:52:31,774 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 14:52:31,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:52:31,777 INFO L225 Difference]: With dead ends: 705 [2021-06-05 14:52:31,777 INFO L226 Difference]: Without dead ends: 690 [2021-06-05 14:52:31,778 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 3873.9ms TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:52:31,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2021-06-05 14:52:31,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 406. [2021-06-05 14:52:31,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 3.0320987654320986) internal successors, (1228), 405 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:52:31,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1228 transitions. [2021-06-05 14:52:31,782 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 1228 transitions. Word has length 20 [2021-06-05 14:52:31,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:52:31,783 INFO L482 AbstractCegarLoop]: Abstraction has 406 states and 1228 transitions. [2021-06-05 14:52:31,783 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 14:52:31,783 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1228 transitions. [2021-06-05 14:52:31,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:52:31,783 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:52:31,783 INFO L521 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 14:52:31,983 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4983,246 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:52:31,984 INFO L430 AbstractCegarLoop]: === Iteration 437 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:52:31,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:52:31,984 INFO L82 PathProgramCache]: Analyzing trace with hash 341702684, now seen corresponding path program 45 times [2021-06-05 14:52:31,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:52:31,984 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429161516] [2021-06-05 14:52:31,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:52:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:52:32,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 14:52:32,493 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:52:32,493 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429161516] [2021-06-05 14:52:32,493 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429161516] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:52:32,493 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745355228] [2021-06-05 14:52:32,493 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 14:52:32,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:52:32,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:52:32,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 14:52:32,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:52:32,971 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52: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 15 treesize of output 11 [2021-06-05 14:52:32,973 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:33,300 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 112 [2021-06-05 14:52:33,301 INFO L628 ElimStorePlain]: treesize reduction 188, result has 68.1 percent of original size [2021-06-05 14:52:33,305 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:33,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 14:52:33,306 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:33,472 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-05 14:52:33,473 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:33,477 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:33,478 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:33,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:33,479 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:33,483 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:33,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 31 treesize of output 23 [2021-06-05 14:52:33,484 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:33,614 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-05 14:52:33,615 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:33,619 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:33,619 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:33,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:33,620 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:33,624 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:33,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:33,625 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:33,752 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-06-05 14:52:33,752 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:33,757 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:33,757 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:33,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 14:52:33,758 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:33,762 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:33,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 14:52:33,763 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:33,879 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 14:52:33,879 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:33,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:33,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:33,884 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:34,002 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 14:52:34,002 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:34,008 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 14:52:34,008 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:597, output treesize:298 [2021-06-05 14:52:34,221 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 109 [2021-06-05 14:52:34,387 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-06-05 14:52:34,837 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2021-06-05 14:52:35,141 INFO L446 ElimStorePlain]: Different costs {0=[get_6, v_prenex_891, v_prenex_893, v_prenex_895, v_prenex_897, v_prenex_920, v_prenex_931, v_prenex_899, v_prenex_911, v_prenex_922, v_prenex_889, v_prenex_913, v_prenex_924, v_prenex_902, v_prenex_915, v_prenex_927, v_prenex_905, v_prenex_918, v_prenex_907, v_prenex_909], 1=[get_3, v_prenex_890, v_prenex_892, v_prenex_894, v_prenex_896, v_prenex_930, v_prenex_887, v_prenex_898, v_prenex_910, v_prenex_921, v_prenex_912, v_prenex_923, v_prenex_901, v_prenex_914, v_prenex_926, v_prenex_904, v_prenex_917, v_prenex_906, v_prenex_919, v_prenex_908]} [2021-06-05 14:52:35,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 14:52:35,155 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:35,897 WARN L205 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 369 DAG size of output: 152 [2021-06-05 14:52:35,897 INFO L628 ElimStorePlain]: treesize reduction 1693, result has 22.8 percent of original size [2021-06-05 14:52:35,898 INFO L518 ElimStorePlain]: Eliminatee v_prenex_891 vanished before elimination [2021-06-05 14:52:35,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 14:52:35,906 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:36,093 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2021-06-05 14:52:36,093 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:36,093 INFO L518 ElimStorePlain]: Eliminatee v_prenex_895 vanished before elimination [2021-06-05 14:52:36,093 INFO L518 ElimStorePlain]: Eliminatee v_prenex_897 vanished before elimination [2021-06-05 14:52:36,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 16 treesize of output 12 [2021-06-05 14:52:36,101 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:36,278 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2021-06-05 14:52:36,278 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:36,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:36,286 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:36,461 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2021-06-05 14:52:36,462 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:36,462 INFO L518 ElimStorePlain]: Eliminatee v_prenex_899 vanished before elimination [2021-06-05 14:52:36,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:36,469 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:36,641 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2021-06-05 14:52:36,641 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:36,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 9 treesize of output 7 [2021-06-05 14:52:36,648 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:36,819 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-06-05 14:52:36,819 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:36,820 INFO L518 ElimStorePlain]: Eliminatee v_prenex_889 vanished before elimination [2021-06-05 14:52:36,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 7 treesize of output 5 [2021-06-05 14:52:36,826 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:36,997 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-06-05 14:52:36,997 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:37,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:37,003 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:37,166 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2021-06-05 14:52:37,166 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:37,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:37,172 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:37,332 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-05 14:52:37,332 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:37,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 7 treesize of output 5 [2021-06-05 14:52:37,338 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:37,502 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-06-05 14:52:37,503 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:37,503 INFO L518 ElimStorePlain]: Eliminatee v_prenex_927 vanished before elimination [2021-06-05 14:52:37,503 INFO L518 ElimStorePlain]: Eliminatee v_prenex_905 vanished before elimination [2021-06-05 14:52:37,503 INFO L518 ElimStorePlain]: Eliminatee v_prenex_918 vanished before elimination [2021-06-05 14:52:37,503 INFO L518 ElimStorePlain]: Eliminatee v_prenex_907 vanished before elimination [2021-06-05 14:52:37,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 7 treesize of output 5 [2021-06-05 14:52:37,508 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:37,669 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-06-05 14:52:37,669 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:37,669 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 14:52:37,669 INFO L518 ElimStorePlain]: Eliminatee v_prenex_890 vanished before elimination [2021-06-05 14:52:37,669 INFO L518 ElimStorePlain]: Eliminatee v_prenex_892 vanished before elimination [2021-06-05 14:52:37,669 INFO L518 ElimStorePlain]: Eliminatee v_prenex_894 vanished before elimination [2021-06-05 14:52:37,669 INFO L518 ElimStorePlain]: Eliminatee v_prenex_896 vanished before elimination [2021-06-05 14:52:37,669 INFO L518 ElimStorePlain]: Eliminatee v_prenex_930 vanished before elimination [2021-06-05 14:52:37,669 INFO L518 ElimStorePlain]: Eliminatee v_prenex_887 vanished before elimination [2021-06-05 14:52:37,669 INFO L518 ElimStorePlain]: Eliminatee v_prenex_898 vanished before elimination [2021-06-05 14:52:37,669 INFO L518 ElimStorePlain]: Eliminatee v_prenex_910 vanished before elimination [2021-06-05 14:52:37,669 INFO L518 ElimStorePlain]: Eliminatee v_prenex_921 vanished before elimination [2021-06-05 14:52:37,670 INFO L518 ElimStorePlain]: Eliminatee v_prenex_912 vanished before elimination [2021-06-05 14:52:37,670 INFO L518 ElimStorePlain]: Eliminatee v_prenex_923 vanished before elimination [2021-06-05 14:52:37,670 INFO L518 ElimStorePlain]: Eliminatee v_prenex_901 vanished before elimination [2021-06-05 14:52:37,670 INFO L518 ElimStorePlain]: Eliminatee v_prenex_914 vanished before elimination [2021-06-05 14:52:37,670 INFO L518 ElimStorePlain]: Eliminatee v_prenex_926 vanished before elimination [2021-06-05 14:52:37,670 INFO L518 ElimStorePlain]: Eliminatee v_prenex_904 vanished before elimination [2021-06-05 14:52:37,670 INFO L518 ElimStorePlain]: Eliminatee v_prenex_917 vanished before elimination [2021-06-05 14:52:37,670 INFO L518 ElimStorePlain]: Eliminatee v_prenex_906 vanished before elimination [2021-06-05 14:52:37,670 INFO L518 ElimStorePlain]: Eliminatee v_prenex_919 vanished before elimination [2021-06-05 14:52:37,670 INFO L518 ElimStorePlain]: Eliminatee v_prenex_908 vanished before elimination [2021-06-05 14:52:37,676 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 14:52:37,676 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 60 variables, input treesize:2201, output treesize:346 [2021-06-05 14:52:37,953 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2021-06-05 14:52:38,173 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2021-06-05 14:52:38,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 14:52:38,311 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745355228] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:52:38,311 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:52:38,311 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:52:38,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387681877] [2021-06-05 14:52:38,311 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:52:38,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:52:38,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:52:38,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:52:38,312 INFO L87 Difference]: Start difference. First operand 406 states and 1228 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 14:52:38,759 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 135 [2021-06-05 14:52:39,347 WARN L205 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 139 [2021-06-05 14:52:40,434 WARN L205 SmtUtils]: Spent 973.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 184 [2021-06-05 14:52:41,245 WARN L205 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 162 [2021-06-05 14:52:41,505 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 59 [2021-06-05 14:52:42,406 WARN L205 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 177 [2021-06-05 14:52:42,603 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2021-06-05 14:52:42,767 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 57 [2021-06-05 14:52:43,162 WARN L205 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 120 [2021-06-05 14:52:44,179 WARN L205 SmtUtils]: Spent 954.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 186 [2021-06-05 14:52:44,442 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 110 [2021-06-05 14:52:44,762 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 102 [2021-06-05 14:52:44,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:52:44,943 INFO L93 Difference]: Finished difference Result 826 states and 2253 transitions. [2021-06-05 14:52:44,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 14:52:44,943 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 14:52:44,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:52:44,944 INFO L225 Difference]: With dead ends: 826 [2021-06-05 14:52:44,944 INFO L226 Difference]: Without dead ends: 763 [2021-06-05 14:52:44,944 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 7822.4ms TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2021-06-05 14:52:44,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2021-06-05 14:52:44,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 421. [2021-06-05 14:52:44,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.0476190476190474) internal successors, (1280), 420 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:52:44,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1280 transitions. [2021-06-05 14:52:44,949 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1280 transitions. Word has length 20 [2021-06-05 14:52:44,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:52:44,950 INFO L482 AbstractCegarLoop]: Abstraction has 421 states and 1280 transitions. [2021-06-05 14:52:44,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 14:52:44,950 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1280 transitions. [2021-06-05 14:52:44,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:52:44,950 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:52:44,950 INFO L521 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 14:52:45,150 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 247 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5088 [2021-06-05 14:52:45,151 INFO L430 AbstractCegarLoop]: === Iteration 438 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:52:45,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:52:45,151 INFO L82 PathProgramCache]: Analyzing trace with hash -828486312, now seen corresponding path program 46 times [2021-06-05 14:52:45,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:52:45,151 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611074368] [2021-06-05 14:52:45,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:52:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:52:45,550 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 14:52:45,550 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:52:45,550 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611074368] [2021-06-05 14:52:45,550 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611074368] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:52:45,550 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718251418] [2021-06-05 14:52:45,550 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 14:52:45,576 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:52:45,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:52:45,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:52:45,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:52:45,831 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:45,831 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:45,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:45,832 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:45,836 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:45,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:45,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 14:52:45,838 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:45,842 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:45,842 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:45,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:45,844 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:45,848 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:45,848 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:45,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 31 treesize of output 23 [2021-06-05 14:52:45,849 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:45,853 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:45,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:45,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 37 treesize of output 27 [2021-06-05 14:52:45,855 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:45,858 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:45,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 38 treesize of output 28 [2021-06-05 14:52:45,859 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:46,087 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2021-06-05 14:52:46,088 INFO L628 ElimStorePlain]: treesize reduction 326, result has 47.3 percent of original size [2021-06-05 14:52:46,091 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:46,091 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:46,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 14:52:46,092 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:46,095 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:46,096 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:46,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:46,097 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:46,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:46,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 15 treesize of output 11 [2021-06-05 14:52:46,101 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:46,285 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2021-06-05 14:52:46,285 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 14:52:46,288 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:46,289 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:46,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:46,290 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:46,293 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:46,293 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:46,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 22 treesize of output 16 [2021-06-05 14:52:46,294 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:46,297 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:46,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 23 treesize of output 17 [2021-06-05 14:52:46,298 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:46,381 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:46,387 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 14:52:46,387 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:805, output treesize:225 [2021-06-05 14:52:47,441 INFO L446 ElimStorePlain]: Different costs {0=[get_6, v_prenex_970, v_prenex_960, v_prenex_972, v_prenex_950, v_prenex_962, v_prenex_952, v_prenex_964, v_prenex_954, v_prenex_966, v_prenex_978, v_prenex_956, v_prenex_968, v_prenex_958], 1=[get_3, v_prenex_971, v_prenex_961, v_prenex_951, v_prenex_963, v_prenex_953, v_prenex_965, v_prenex_977, v_prenex_955, v_prenex_967, v_prenex_957, v_prenex_969, v_prenex_959, v_prenex_949]} [2021-06-05 14:52:47,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 15 treesize of output 11 [2021-06-05 14:52:47,452 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:47,916 WARN L205 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 108 [2021-06-05 14:52:47,916 INFO L628 ElimStorePlain]: treesize reduction 1142, result has 24.2 percent of original size [2021-06-05 14:52:47,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 7 treesize of output 5 [2021-06-05 14:52:47,922 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:48,050 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-06-05 14:52:48,051 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:48,051 INFO L518 ElimStorePlain]: Eliminatee v_prenex_960 vanished before elimination [2021-06-05 14:52:48,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:48,056 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:48,181 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-06-05 14:52:48,181 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:48,181 INFO L518 ElimStorePlain]: Eliminatee v_prenex_950 vanished before elimination [2021-06-05 14:52:48,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:48,187 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:48,309 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-06-05 14:52:48,310 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:48,310 INFO L518 ElimStorePlain]: Eliminatee v_prenex_952 vanished before elimination [2021-06-05 14:52:48,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:48,315 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:48,451 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-05 14:52:48,452 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:48,452 INFO L518 ElimStorePlain]: Eliminatee v_prenex_954 vanished before elimination [2021-06-05 14:52:48,452 INFO L518 ElimStorePlain]: Eliminatee v_prenex_966 vanished before elimination [2021-06-05 14:52:48,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 7 treesize of output 5 [2021-06-05 14:52:48,458 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:48,575 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-06-05 14:52:48,575 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:48,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:48,580 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:48,696 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-06-05 14:52:48,696 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:48,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:48,701 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:48,814 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-06-05 14:52:48,815 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:48,815 INFO L518 ElimStorePlain]: Eliminatee v_prenex_958 vanished before elimination [2021-06-05 14:52:48,815 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 14:52:48,815 INFO L518 ElimStorePlain]: Eliminatee v_prenex_971 vanished before elimination [2021-06-05 14:52:48,815 INFO L518 ElimStorePlain]: Eliminatee v_prenex_961 vanished before elimination [2021-06-05 14:52:48,815 INFO L518 ElimStorePlain]: Eliminatee v_prenex_951 vanished before elimination [2021-06-05 14:52:48,815 INFO L518 ElimStorePlain]: Eliminatee v_prenex_963 vanished before elimination [2021-06-05 14:52:48,815 INFO L518 ElimStorePlain]: Eliminatee v_prenex_953 vanished before elimination [2021-06-05 14:52:48,815 INFO L518 ElimStorePlain]: Eliminatee v_prenex_965 vanished before elimination [2021-06-05 14:52:48,815 INFO L518 ElimStorePlain]: Eliminatee v_prenex_977 vanished before elimination [2021-06-05 14:52:48,815 INFO L518 ElimStorePlain]: Eliminatee v_prenex_955 vanished before elimination [2021-06-05 14:52:48,815 INFO L518 ElimStorePlain]: Eliminatee v_prenex_967 vanished before elimination [2021-06-05 14:52:48,815 INFO L518 ElimStorePlain]: Eliminatee v_prenex_957 vanished before elimination [2021-06-05 14:52:48,815 INFO L518 ElimStorePlain]: Eliminatee v_prenex_969 vanished before elimination [2021-06-05 14:52:48,815 INFO L518 ElimStorePlain]: Eliminatee v_prenex_959 vanished before elimination [2021-06-05 14:52:48,815 INFO L518 ElimStorePlain]: Eliminatee v_prenex_949 vanished before elimination [2021-06-05 14:52:48,819 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 14:52:48,819 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 42 variables, input treesize:1513, output treesize:253 [2021-06-05 14:52:49,129 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2021-06-05 14:52:49,258 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 14:52:49,258 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718251418] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:52:49,258 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:52:49,258 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:52:49,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917422290] [2021-06-05 14:52:49,258 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:52:49,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:52:49,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:52:49,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:52:49,259 INFO L87 Difference]: Start difference. First operand 421 states and 1280 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 14:52:49,892 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 118 [2021-06-05 14:52:50,441 WARN L205 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 122 [2021-06-05 14:52:51,205 WARN L205 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 140 [2021-06-05 14:52:51,954 WARN L205 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 146 [2021-06-05 14:52:52,790 WARN L205 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 155 [2021-06-05 14:52:53,744 WARN L205 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 168 [2021-06-05 14:52:53,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:52:53,782 INFO L93 Difference]: Finished difference Result 671 states and 1895 transitions. [2021-06-05 14:52:53,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:52:53,782 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 14:52:53,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:52:53,783 INFO L225 Difference]: With dead ends: 671 [2021-06-05 14:52:53,783 INFO L226 Difference]: Without dead ends: 656 [2021-06-05 14:52:53,783 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 5199.7ms TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:52:53,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2021-06-05 14:52:53,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 418. [2021-06-05 14:52:53,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 3.0431654676258995) internal successors, (1269), 417 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:52:53,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1269 transitions. [2021-06-05 14:52:53,788 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1269 transitions. Word has length 20 [2021-06-05 14:52:53,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:52:53,788 INFO L482 AbstractCegarLoop]: Abstraction has 418 states and 1269 transitions. [2021-06-05 14:52:53,788 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 14:52:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1269 transitions. [2021-06-05 14:52:53,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:52:53,789 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:52:53,789 INFO L521 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 14:52:53,989 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5214,248 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:52:53,989 INFO L430 AbstractCegarLoop]: === Iteration 439 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:52:53,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:52:53,990 INFO L82 PathProgramCache]: Analyzing trace with hash -574161018, now seen corresponding path program 47 times [2021-06-05 14:52:53,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:52:53,990 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250487035] [2021-06-05 14:52:53,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:52:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:52:54,353 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 14:52:54,353 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:52:54,353 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250487035] [2021-06-05 14:52:54,353 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250487035] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:52:54,353 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454015769] [2021-06-05 14:52:54,353 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 14:52:54,380 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:52:54,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:52:54,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:52:54,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:52:54,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:54,499 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,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 31 treesize of output 23 [2021-06-05 14:52:54,508 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,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 31 treesize of output 23 [2021-06-05 14:52:54,513 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,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 31 treesize of output 23 [2021-06-05 14:52:54,517 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,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 36 treesize of output 26 [2021-06-05 14:52:54,521 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,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 37 treesize of output 27 [2021-06-05 14:52:54,524 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,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 30 treesize of output 22 [2021-06-05 14:52:54,530 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,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 37 treesize of output 27 [2021-06-05 14:52:54,534 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,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 37 treesize of output 27 [2021-06-05 14:52:54,538 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,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 29 treesize of output 21 [2021-06-05 14:52:54,542 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:54,546 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:54,550 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,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 29 treesize of output 21 [2021-06-05 14:52:54,553 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:54,557 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,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 14:52:54,561 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:54,565 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,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 37 treesize of output 27 [2021-06-05 14:52:54,569 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,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 37 treesize of output 27 [2021-06-05 14:52:54,573 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,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 38 treesize of output 28 [2021-06-05 14:52:54,577 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:54,580 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:54,584 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:54,588 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:54,591 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:54,597 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,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 45 treesize of output 33 [2021-06-05 14:52:54,601 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:54,605 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:54,609 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:54,613 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,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 43 treesize of output 31 [2021-06-05 14:52:54,617 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,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 14:52:54,620 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,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 36 treesize of output 26 [2021-06-05 14:52:54,623 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:52:54,627 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,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 37 treesize of output 27 [2021-06-05 14:52:54,630 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,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 38 treesize of output 28 [2021-06-05 14:52:54,634 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,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 44 treesize of output 32 [2021-06-05 14:52:54,637 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,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 14:52:54,640 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:54,751 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2021-06-05 14:52:54,751 INFO L628 ElimStorePlain]: treesize reduction 248, result has 37.5 percent of original size [2021-06-05 14:52:54,752 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:52:54,752 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1549, output treesize:149 [2021-06-05 14:52:55,050 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2021-06-05 14:52:55,314 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 14:52:55,314 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454015769] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:52:55,314 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:52:55,314 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:52:55,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470394572] [2021-06-05 14:52:55,314 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:52:55,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:52:55,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:52:55,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:52:55,315 INFO L87 Difference]: Start difference. First operand 418 states and 1269 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 14:52:55,701 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2021-06-05 14:52:55,969 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2021-06-05 14:52:56,298 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 84 [2021-06-05 14:52:56,795 WARN L205 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 94 [2021-06-05 14:52:57,069 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2021-06-05 14:52:57,387 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 94 [2021-06-05 14:52:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:52:57,408 INFO L93 Difference]: Finished difference Result 644 states and 1836 transitions. [2021-06-05 14:52:57,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:52:57,408 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 14:52:57,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:52:57,409 INFO L225 Difference]: With dead ends: 644 [2021-06-05 14:52:57,409 INFO L226 Difference]: Without dead ends: 629 [2021-06-05 14:52:57,409 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2659.9ms TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:52:57,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-06-05 14:52:57,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 418. [2021-06-05 14:52:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 3.0431654676258995) internal successors, (1269), 417 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:52:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1269 transitions. [2021-06-05 14:52:57,414 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1269 transitions. Word has length 20 [2021-06-05 14:52:57,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:52:57,414 INFO L482 AbstractCegarLoop]: Abstraction has 418 states and 1269 transitions. [2021-06-05 14:52:57,414 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 14:52:57,414 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1269 transitions. [2021-06-05 14:52:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:52:57,415 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:52:57,415 INFO L521 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 14:52:57,615 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5379,249 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:52:57,615 INFO L430 AbstractCegarLoop]: === Iteration 440 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:52:57,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:52:57,615 INFO L82 PathProgramCache]: Analyzing trace with hash 637711574, now seen corresponding path program 48 times [2021-06-05 14:52:57,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:52:57,615 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934631200] [2021-06-05 14:52:57,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:52:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:52:57,967 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 14:52:57,967 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:52:57,967 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934631200] [2021-06-05 14:52:57,968 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934631200] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:52:57,968 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207204941] [2021-06-05 14:52:57,968 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 14:52:57,994 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:52:57,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:52:57,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 32 conjunts are in the unsatisfiable core [2021-06-05 14:52:57,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:52:58,327 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:58,327 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:58,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:58,328 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:58,332 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:58,333 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:58,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:58,334 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:58,340 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:58,340 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:58,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 39 treesize of output 27 [2021-06-05 14:52:58,341 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:58,345 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:58,346 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:58,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 38 treesize of output 26 [2021-06-05 14:52:58,346 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:58,352 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:58,353 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:58,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 45 treesize of output 31 [2021-06-05 14:52:58,354 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:58,358 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:58,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:58,359 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:58,595 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2021-06-05 14:52:58,596 INFO L628 ElimStorePlain]: treesize reduction 347, result has 48.7 percent of original size [2021-06-05 14:52:58,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:58,600 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:58,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:58,601 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:58,604 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:58,604 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:58,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:58,605 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:58,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:58,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 19 treesize of output 13 [2021-06-05 14:52:58,609 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:58,785 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2021-06-05 14:52:58,786 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 14:52:58,789 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:58,789 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:58,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 26 treesize of output 18 [2021-06-05 14:52:58,790 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:58,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:58,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:58,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:52:58,794 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:58,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:52:58,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 27 treesize of output 19 [2021-06-05 14:52:58,798 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:52:58,879 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:52:58,885 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 14:52:58,885 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:901, output treesize:245 [2021-06-05 14:52:59,158 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-06-05 14:52:59,639 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 129 [2021-06-05 14:53:00,838 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2021-06-05 14:53:00,931 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 14:53:00,932 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207204941] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:53:00,932 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:53:00,932 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:53:00,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030839614] [2021-06-05 14:53:00,932 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:53:00,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:53:00,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:53:00,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:53:00,932 INFO L87 Difference]: Start difference. First operand 418 states and 1269 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 14:53:01,522 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 124 [2021-06-05 14:53:01,976 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 124 [2021-06-05 14:53:02,763 WARN L205 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 164 [2021-06-05 14:53:03,328 WARN L205 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 155 [2021-06-05 14:53:04,663 WARN L205 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 207 DAG size of output: 161 [2021-06-05 14:53:05,685 WARN L205 SmtUtils]: Spent 905.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 173 [2021-06-05 14:53:05,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:53:05,703 INFO L93 Difference]: Finished difference Result 667 states and 1883 transitions. [2021-06-05 14:53:05,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:53:05,704 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 14:53:05,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:53:05,705 INFO L225 Difference]: With dead ends: 667 [2021-06-05 14:53:05,705 INFO L226 Difference]: Without dead ends: 652 [2021-06-05 14:53:05,705 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 5577.6ms TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:53:05,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2021-06-05 14:53:05,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 422. [2021-06-05 14:53:05,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 3.0522565320665085) internal successors, (1285), 421 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:53:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1285 transitions. [2021-06-05 14:53:05,710 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1285 transitions. Word has length 20 [2021-06-05 14:53:05,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:53:05,710 INFO L482 AbstractCegarLoop]: Abstraction has 422 states and 1285 transitions. [2021-06-05 14:53:05,710 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 14:53:05,710 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1285 transitions. [2021-06-05 14:53:05,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:53:05,710 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:53:05,711 INFO L521 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 14:53:05,911 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 250 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5404 [2021-06-05 14:53:05,911 INFO L430 AbstractCegarLoop]: === Iteration 441 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:53:05,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:53:05,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1777995410, now seen corresponding path program 49 times [2021-06-05 14:53:05,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:53:05,911 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454915052] [2021-06-05 14:53:05,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:53:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:53:06,213 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 14:53:06,213 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:53:06,213 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454915052] [2021-06-05 14:53:06,213 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454915052] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:53:06,213 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490690776] [2021-06-05 14:53:06,213 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 14:53:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:53:06,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:53:06,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:53:06,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:06,504 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:06,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:06,505 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:06,508 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:06,509 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:06,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:06,510 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:06,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:06,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:06,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:06,515 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:06,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:06,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:06,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 29 treesize of output 21 [2021-06-05 14:53:06,520 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:06,524 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:06,524 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:06,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:06,525 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:06,528 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:06,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 14:53:06,529 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:06,784 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2021-06-05 14:53:06,785 INFO L628 ElimStorePlain]: treesize reduction 378, result has 46.1 percent of original size [2021-06-05 14:53:06,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:06,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:06,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 14:53:06,789 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:06,792 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:06,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:06,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:06,794 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:06,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:06,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 22 treesize of output 16 [2021-06-05 14:53:06,798 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:06,993 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2021-06-05 14:53:06,993 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 14:53:06,997 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:06,997 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:06,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 23 treesize of output 17 [2021-06-05 14:53:06,999 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:07,001 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:07,002 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:07,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:07,003 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:07,006 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:07,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 23 treesize of output 17 [2021-06-05 14:53:07,007 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:07,200 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2021-06-05 14:53:07,200 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 14:53:07,206 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 14:53:07,206 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:805, output treesize:218 [2021-06-05 14:53:07,688 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2021-06-05 14:53:08,318 INFO L446 ElimStorePlain]: Different costs {0=[get_6, v_prenex_1021, v_prenex_1023, v_prenex_1015, v_prenex_1025, v_prenex_1017, v_prenex_1019], 1=[get_3, v_prenex_1020, v_prenex_1022, v_prenex_1024, v_prenex_1014, v_prenex_1016, v_prenex_1018]} [2021-06-05 14:53:08,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:08,328 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:08,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:08,342 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:08,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 14:53:08,352 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:08,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:08,367 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:08,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:08,377 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:08,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 23 treesize of output 17 [2021-06-05 14:53:08,385 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:08,862 WARN L205 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 101 [2021-06-05 14:53:08,863 INFO L628 ElimStorePlain]: treesize reduction 1778, result has 16.4 percent of original size [2021-06-05 14:53:08,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 16 treesize of output 12 [2021-06-05 14:53:08,869 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:08,995 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-06-05 14:53:08,996 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:09,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:09,001 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:09,122 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-06-05 14:53:09,122 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:09,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:09,128 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:09,247 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-06-05 14:53:09,248 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:09,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:09,253 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:09,375 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-06-05 14:53:09,375 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:09,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 9 treesize of output 7 [2021-06-05 14:53:09,380 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:09,494 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-06-05 14:53:09,494 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:09,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:09,499 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:09,610 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-06-05 14:53:09,610 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:09,610 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 14:53:09,610 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1020 vanished before elimination [2021-06-05 14:53:09,610 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1022 vanished before elimination [2021-06-05 14:53:09,610 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1024 vanished before elimination [2021-06-05 14:53:09,610 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1014 vanished before elimination [2021-06-05 14:53:09,610 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1016 vanished before elimination [2021-06-05 14:53:09,610 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1018 vanished before elimination [2021-06-05 14:53:09,614 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 14:53:09,614 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 21 variables, input treesize:2293, output treesize:253 [2021-06-05 14:53:09,912 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2021-06-05 14:53:10,044 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 14:53:10,044 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490690776] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:53:10,044 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:53:10,044 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:53:10,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048232927] [2021-06-05 14:53:10,044 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:53:10,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:53:10,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:53:10,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:53:10,044 INFO L87 Difference]: Start difference. First operand 422 states and 1285 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 14:53:10,605 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 121 [2021-06-05 14:53:11,038 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 125 [2021-06-05 14:53:11,604 WARN L205 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 135 [2021-06-05 14:53:12,048 WARN L205 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 139 [2021-06-05 14:53:12,852 WARN L205 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 155 [2021-06-05 14:53:13,463 WARN L205 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 166 [2021-06-05 14:53:13,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:53:13,492 INFO L93 Difference]: Finished difference Result 674 states and 1901 transitions. [2021-06-05 14:53:13,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:53:13,493 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 14:53:13,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:53:13,493 INFO L225 Difference]: With dead ends: 674 [2021-06-05 14:53:13,493 INFO L226 Difference]: Without dead ends: 659 [2021-06-05 14:53:13,494 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 4087.3ms TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:53:13,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2021-06-05 14:53:13,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 420. [2021-06-05 14:53:13,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 3.045346062052506) internal successors, (1276), 419 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:53:13,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1276 transitions. [2021-06-05 14:53:13,498 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1276 transitions. Word has length 20 [2021-06-05 14:53:13,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:53:13,499 INFO L482 AbstractCegarLoop]: Abstraction has 420 states and 1276 transitions. [2021-06-05 14:53:13,499 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 14:53:13,499 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1276 transitions. [2021-06-05 14:53:13,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:53:13,499 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:53:13,499 INFO L521 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 14:53:13,699 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5677,251 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:53:13,700 INFO L430 AbstractCegarLoop]: === Iteration 442 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:53:13,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:53:13,700 INFO L82 PathProgramCache]: Analyzing trace with hash -997933088, now seen corresponding path program 50 times [2021-06-05 14:53:13,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:53:13,700 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585639035] [2021-06-05 14:53:13,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:53:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:53:13,952 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 14:53:13,952 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:53:13,952 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585639035] [2021-06-05 14:53:13,952 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585639035] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:53:13,952 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983566066] [2021-06-05 14:53:13,952 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 14:53:13,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:53:13,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:53:13,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 14:53:13,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:53:14,427 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:14,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 14:53:14,428 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:14,751 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 112 [2021-06-05 14:53:14,752 INFO L628 ElimStorePlain]: treesize reduction 188, result has 68.1 percent of original size [2021-06-05 14:53:14,756 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:14,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 23 treesize of output 17 [2021-06-05 14:53:14,757 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:14,905 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-05 14:53:14,906 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:14,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:14,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:14,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 14:53:14,911 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:14,916 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:14,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:14,916 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:15,058 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-05 14:53:15,059 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:15,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:15,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:15,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 31 treesize of output 23 [2021-06-05 14:53:15,065 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:15,069 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:15,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:15,070 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:15,200 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-06-05 14:53:15,200 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:15,209 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:15,209 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:15,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:15,211 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:15,214 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:15,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:15,215 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:15,337 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 14:53:15,337 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:15,341 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:15,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 14:53:15,342 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:15,462 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 14:53:15,462 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:15,470 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 14:53:15,470 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:597, output treesize:298 [2021-06-05 14:53:15,673 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 109 [2021-06-05 14:53:15,843 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-06-05 14:53:16,019 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-06-05 14:53:16,408 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 94 [2021-06-05 14:53:16,656 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1060, v_prenex_1040, v_prenex_1062, v_prenex_1072, v_prenex_1050, v_prenex_1064, v_prenex_1052, get_6, v_prenex_1076, v_prenex_1054, v_prenex_1043, v_prenex_1057, v_prenex_1067, v_prenex_1045, v_prenex_1048, v_prenex_1069], 1=[v_prenex_1071, get_3, v_prenex_1051, v_prenex_1061, v_prenex_1075, v_prenex_1053, v_prenex_1063, v_prenex_1041, v_prenex_1066, v_prenex_1044, v_prenex_1068, v_prenex_1056, v_prenex_1058, v_prenex_1047, v_prenex_1039, v_prenex_1049]} [2021-06-05 14:53:16,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 23 treesize of output 17 [2021-06-05 14:53:16,669 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:16,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 30 treesize of output 22 [2021-06-05 14:53:16,682 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:16,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 23 treesize of output 17 [2021-06-05 14:53:16,695 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:17,251 WARN L205 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 129 [2021-06-05 14:53:17,252 INFO L628 ElimStorePlain]: treesize reduction 1291, result has 23.8 percent of original size [2021-06-05 14:53:17,252 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1040 vanished before elimination [2021-06-05 14:53:17,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 7 treesize of output 5 [2021-06-05 14:53:17,258 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:17,399 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-06-05 14:53:17,400 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:17,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:17,406 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:17,546 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-06-05 14:53:17,546 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:17,546 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1050 vanished before elimination [2021-06-05 14:53:17,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 7 treesize of output 5 [2021-06-05 14:53:17,552 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:17,688 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-06-05 14:53:17,688 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:17,688 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1052 vanished before elimination [2021-06-05 14:53:17,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 7 treesize of output 5 [2021-06-05 14:53:17,694 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:17,829 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-06-05 14:53:17,829 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:17,830 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1076 vanished before elimination [2021-06-05 14:53:17,830 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1054 vanished before elimination [2021-06-05 14:53:17,830 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1043 vanished before elimination [2021-06-05 14:53:17,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 16 treesize of output 12 [2021-06-05 14:53:17,837 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:17,971 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-06-05 14:53:17,971 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:17,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 7 treesize of output 5 [2021-06-05 14:53:17,977 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:18,105 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-06-05 14:53:18,106 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:18,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:18,111 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:18,241 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-06-05 14:53:18,241 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:18,241 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1048 vanished before elimination [2021-06-05 14:53:18,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:18,246 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:18,367 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 14:53:18,367 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:18,367 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1071 vanished before elimination [2021-06-05 14:53:18,368 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 14:53:18,368 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1051 vanished before elimination [2021-06-05 14:53:18,368 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1061 vanished before elimination [2021-06-05 14:53:18,368 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1075 vanished before elimination [2021-06-05 14:53:18,368 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1053 vanished before elimination [2021-06-05 14:53:18,368 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1063 vanished before elimination [2021-06-05 14:53:18,368 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1041 vanished before elimination [2021-06-05 14:53:18,368 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1066 vanished before elimination [2021-06-05 14:53:18,368 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1044 vanished before elimination [2021-06-05 14:53:18,368 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1068 vanished before elimination [2021-06-05 14:53:18,368 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1056 vanished before elimination [2021-06-05 14:53:18,368 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1058 vanished before elimination [2021-06-05 14:53:18,368 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1047 vanished before elimination [2021-06-05 14:53:18,368 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1039 vanished before elimination [2021-06-05 14:53:18,368 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1049 vanished before elimination [2021-06-05 14:53:18,380 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 14:53:18,381 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 48 variables, input treesize:1723, output treesize:276 [2021-06-05 14:53:18,592 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2021-06-05 14:53:18,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 14:53:18,717 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983566066] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:53:18,717 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:53:18,717 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:53:18,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761446767] [2021-06-05 14:53:18,717 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:53:18,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:53:18,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:53:18,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:53:18,717 INFO L87 Difference]: Start difference. First operand 420 states and 1276 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 14:53:19,063 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-06-05 14:53:19,554 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-06-05 14:53:19,688 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2021-06-05 14:53:20,213 WARN L205 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 140 [2021-06-05 14:53:20,406 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2021-06-05 14:53:21,246 WARN L205 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 175 [2021-06-05 14:53:21,456 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2021-06-05 14:53:21,875 WARN L205 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 149 [2021-06-05 14:53:22,491 WARN L205 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 162 [2021-06-05 14:53:22,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:53:22,640 INFO L93 Difference]: Finished difference Result 784 states and 2208 transitions. [2021-06-05 14:53:22,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 14:53:22,640 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 14:53:22,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:53:22,641 INFO L225 Difference]: With dead ends: 784 [2021-06-05 14:53:22,641 INFO L226 Difference]: Without dead ends: 754 [2021-06-05 14:53:22,641 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 4836.8ms TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2021-06-05 14:53:22,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2021-06-05 14:53:22,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 422. [2021-06-05 14:53:22,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 3.0475059382422804) internal successors, (1283), 421 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:53:22,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1283 transitions. [2021-06-05 14:53:22,646 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1283 transitions. Word has length 20 [2021-06-05 14:53:22,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:53:22,646 INFO L482 AbstractCegarLoop]: Abstraction has 422 states and 1283 transitions. [2021-06-05 14:53:22,646 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 14:53:22,646 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1283 transitions. [2021-06-05 14:53:22,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:53:22,647 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:53:22,647 INFO L521 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 14:53:22,847 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 252 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5858 [2021-06-05 14:53:22,847 INFO L430 AbstractCegarLoop]: === Iteration 443 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:53:22,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:53:22,847 INFO L82 PathProgramCache]: Analyzing trace with hash -426176046, now seen corresponding path program 51 times [2021-06-05 14:53:22,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:53:22,848 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254141825] [2021-06-05 14:53:22,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:53:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:53:23,242 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 14:53:23,242 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:53:23,242 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254141825] [2021-06-05 14:53:23,243 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254141825] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:53:23,243 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040676899] [2021-06-05 14:53:23,243 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 14:53:23,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:53:23,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:53:23,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:53:23,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:53:23,598 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:23,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:23,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 22 treesize of output 16 [2021-06-05 14:53:23,599 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:23,603 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:23,604 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:23,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:23,605 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:23,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:23,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:23,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 23 treesize of output 17 [2021-06-05 14:53:23,610 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:23,614 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:23,614 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:23,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 22 treesize of output 16 [2021-06-05 14:53:23,615 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:23,619 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:23,619 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:23,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:23,620 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:23,624 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:23,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 30 treesize of output 22 [2021-06-05 14:53:23,625 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:23,937 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2021-06-05 14:53:23,937 INFO L628 ElimStorePlain]: treesize reduction 441, result has 46.2 percent of original size [2021-06-05 14:53:23,941 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:23,941 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:23,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 23 treesize of output 17 [2021-06-05 14:53:23,942 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:23,946 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:23,946 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:23,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:23,947 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:23,950 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:23,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 23 treesize of output 17 [2021-06-05 14:53:23,951 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:24,196 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2021-06-05 14:53:24,196 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.7 percent of original size [2021-06-05 14:53:24,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:24,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:24,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:24,201 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:24,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:24,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:24,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 15 treesize of output 11 [2021-06-05 14:53:24,206 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:24,209 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:24,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 15 treesize of output 11 [2021-06-05 14:53:24,210 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:24,425 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2021-06-05 14:53:24,426 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.7 percent of original size [2021-06-05 14:53:24,431 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 14:53:24,432 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:931, output treesize:277 [2021-06-05 14:53:24,814 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-06-05 14:53:25,155 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 89 [2021-06-05 14:53:26,050 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1097, v_prenex_1099, get_6, v_prenex_1102, v_prenex_1105, v_prenex_1107], 1=[v_prenex_1108, v_prenex_1098, v_prenex_1101, v_prenex_1103, get_0, v_prenex_1106]} [2021-06-05 14:53:26,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:26,059 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:26,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:26,068 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:26,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 22 treesize of output 16 [2021-06-05 14:53:26,076 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:26,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 29 treesize of output 21 [2021-06-05 14:53:26,085 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:26,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:26,093 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:26,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 23 treesize of output 17 [2021-06-05 14:53:26,101 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:26,496 WARN L205 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 93 [2021-06-05 14:53:26,496 INFO L628 ElimStorePlain]: treesize reduction 1510, result has 15.8 percent of original size [2021-06-05 14:53:26,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:26,502 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:26,595 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:26,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 15 treesize of output 11 [2021-06-05 14:53:26,600 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:26,690 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:26,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 7 treesize of output 5 [2021-06-05 14:53:26,694 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:26,785 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:26,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:26,790 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:26,874 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:26,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 16 treesize of output 12 [2021-06-05 14:53:26,879 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:26,959 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:26,959 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1108 vanished before elimination [2021-06-05 14:53:26,960 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1098 vanished before elimination [2021-06-05 14:53:26,960 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1101 vanished before elimination [2021-06-05 14:53:26,960 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1103 vanished before elimination [2021-06-05 14:53:26,960 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 14:53:26,960 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1106 vanished before elimination [2021-06-05 14:53:26,963 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 14:53:26,963 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 18 variables, input treesize:1959, output treesize:187 [2021-06-05 14:53:27,145 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 14:53:27,146 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040676899] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:53:27,146 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:53:27,146 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:53:27,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921825277] [2021-06-05 14:53:27,146 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:53:27,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:53:27,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:53:27,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:53:27,146 INFO L87 Difference]: Start difference. First operand 422 states and 1283 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 14:53:27,657 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2021-06-05 14:53:28,006 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 136 [2021-06-05 14:53:28,732 WARN L205 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 149 [2021-06-05 14:53:29,618 WARN L205 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 189 [2021-06-05 14:53:29,910 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2021-06-05 14:53:30,242 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2021-06-05 14:53:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:53:30,254 INFO L93 Difference]: Finished difference Result 579 states and 1701 transitions. [2021-06-05 14:53:30,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:53:30,255 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 14:53:30,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:53:30,255 INFO L225 Difference]: With dead ends: 579 [2021-06-05 14:53:30,255 INFO L226 Difference]: Without dead ends: 552 [2021-06-05 14:53:30,256 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 4042.6ms TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:53:30,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2021-06-05 14:53:30,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 426. [2021-06-05 14:53:30,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 3.051764705882353) internal successors, (1297), 425 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:53:30,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1297 transitions. [2021-06-05 14:53:30,260 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1297 transitions. Word has length 20 [2021-06-05 14:53:30,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:53:30,260 INFO L482 AbstractCegarLoop]: Abstraction has 426 states and 1297 transitions. [2021-06-05 14:53:30,260 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 14:53:30,260 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1297 transitions. [2021-06-05 14:53:30,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:53:30,261 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:53:30,261 INFO L521 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 14:53:30,461 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 253 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5981 [2021-06-05 14:53:30,461 INFO L430 AbstractCegarLoop]: === Iteration 444 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:53:30,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:53:30,461 INFO L82 PathProgramCache]: Analyzing trace with hash -633183728, now seen corresponding path program 52 times [2021-06-05 14:53:30,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:53:30,461 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565487724] [2021-06-05 14:53:30,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:53:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:53:30,931 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 14:53:30,931 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:53:30,931 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565487724] [2021-06-05 14:53:30,931 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565487724] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:53:30,931 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370994394] [2021-06-05 14:53:30,931 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 14:53:30,957 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:53:30,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:53:30,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:53:30,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:53:31,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,093 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,097 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,101 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,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 29 treesize of output 21 [2021-06-05 14:53:31,105 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,109 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,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 29 treesize of output 21 [2021-06-05 14:53:31,113 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,118 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,122 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,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 43 treesize of output 31 [2021-06-05 14:53:31,126 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,130 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,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 38 treesize of output 28 [2021-06-05 14:53:31,134 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,138 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,142 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,146 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,151 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,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 30 treesize of output 22 [2021-06-05 14:53:31,154 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,158 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,162 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,166 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,170 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,174 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,178 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,182 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,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 30 treesize of output 22 [2021-06-05 14:53:31,186 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,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 36 treesize of output 26 [2021-06-05 14:53:31,190 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,194 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,198 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,202 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,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 29 treesize of output 21 [2021-06-05 14:53:31,205 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,209 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,213 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,217 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,221 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,224 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,228 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:31,231 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:31,385 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2021-06-05 14:53:31,386 INFO L628 ElimStorePlain]: treesize reduction 303, result has 39.0 percent of original size [2021-06-05 14:53:31,387 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:53:31,388 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1729, output treesize:194 [2021-06-05 14:53:31,837 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 14:53:31,837 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370994394] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:53:31,837 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:53:31,837 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:53:31,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141489832] [2021-06-05 14:53:31,837 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:53:31,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:53:31,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:53:31,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:53:31,838 INFO L87 Difference]: Start difference. First operand 426 states and 1297 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 14:53:32,392 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2021-06-05 14:53:32,729 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 79 [2021-06-05 14:53:32,952 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2021-06-05 14:53:33,282 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2021-06-05 14:53:33,708 WARN L205 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 79 [2021-06-05 14:53:33,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:53:33,720 INFO L93 Difference]: Finished difference Result 619 states and 1772 transitions. [2021-06-05 14:53:33,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:53:33,721 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 14:53:33,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:53:33,721 INFO L225 Difference]: With dead ends: 619 [2021-06-05 14:53:33,721 INFO L226 Difference]: Without dead ends: 598 [2021-06-05 14:53:33,722 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2460.7ms TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:53:33,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2021-06-05 14:53:33,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 428. [2021-06-05 14:53:33,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 3.053864168618267) internal successors, (1304), 427 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:53:33,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1304 transitions. [2021-06-05 14:53:33,726 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1304 transitions. Word has length 20 [2021-06-05 14:53:33,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:53:33,726 INFO L482 AbstractCegarLoop]: Abstraction has 428 states and 1304 transitions. [2021-06-05 14:53:33,726 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 14:53:33,726 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1304 transitions. [2021-06-05 14:53:33,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:53:33,727 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:53:33,727 INFO L521 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 14:53:33,927 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6266,254 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:53:33,927 INFO L430 AbstractCegarLoop]: === Iteration 445 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:53:33,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:53:33,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1851819088, now seen corresponding path program 53 times [2021-06-05 14:53:33,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:53:33,928 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939804200] [2021-06-05 14:53:33,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:53:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:53:34,215 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 14:53:34,215 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:53:34,215 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939804200] [2021-06-05 14:53:34,216 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939804200] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:53:34,216 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255180185] [2021-06-05 14:53:34,216 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 14:53:34,242 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:53:34,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:53:34,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 32 conjunts are in the unsatisfiable core [2021-06-05 14:53:34,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:53:34,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 38 treesize of output 28 [2021-06-05 14:53:34,404 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,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 31 treesize of output 23 [2021-06-05 14:53:34,408 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:34,412 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,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 36 treesize of output 26 [2021-06-05 14:53:34,417 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,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 14:53:34,421 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,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 36 treesize of output 26 [2021-06-05 14:53:34,426 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,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 29 treesize of output 21 [2021-06-05 14:53:34,430 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,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 30 treesize of output 22 [2021-06-05 14:53:34,434 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,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 36 treesize of output 26 [2021-06-05 14:53:34,438 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,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 37 treesize of output 27 [2021-06-05 14:53:34,443 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,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 44 treesize of output 32 [2021-06-05 14:53:34,447 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,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 43 treesize of output 31 [2021-06-05 14:53:34,452 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,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 30 treesize of output 22 [2021-06-05 14:53:34,456 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:34,460 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:34,465 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,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 37 treesize of output 27 [2021-06-05 14:53:34,469 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:34,474 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:34,478 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,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 45 treesize of output 33 [2021-06-05 14:53:34,483 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:34,487 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:34,491 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:34,495 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:34,499 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,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 14:53:34,504 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,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 30 treesize of output 22 [2021-06-05 14:53:34,508 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,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 14:53:34,512 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:34,516 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,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 38 treesize of output 28 [2021-06-05 14:53:34,520 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,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 14:53:34,525 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:34,529 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,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 37 treesize of output 27 [2021-06-05 14:53:34,533 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,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 30 treesize of output 22 [2021-06-05 14:53:34,537 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,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 30 treesize of output 22 [2021-06-05 14:53:34,541 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,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 29 treesize of output 21 [2021-06-05 14:53:34,545 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,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 14:53:34,549 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:34,552 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:34,719 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2021-06-05 14:53:34,719 INFO L628 ElimStorePlain]: treesize reduction 357, result has 39.2 percent of original size [2021-06-05 14:53:34,721 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:53:34,721 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1873, output treesize:230 [2021-06-05 14:53:35,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 14:53:35,266 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255180185] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:53:35,266 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:53:35,267 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:53:35,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336287080] [2021-06-05 14:53:35,267 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:53:35,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:53:35,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:53:35,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:53:35,267 INFO L87 Difference]: Start difference. First operand 428 states and 1304 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 14:53:35,828 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2021-06-05 14:53:36,369 WARN L205 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 97 [2021-06-05 14:53:36,542 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 68 [2021-06-05 14:53:36,750 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2021-06-05 14:53:36,968 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 78 [2021-06-05 14:53:37,148 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2021-06-05 14:53:37,465 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2021-06-05 14:53:37,719 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2021-06-05 14:53:38,182 WARN L205 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2021-06-05 14:53:38,664 WARN L205 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 95 [2021-06-05 14:53:38,815 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2021-06-05 14:53:38,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:53:38,816 INFO L93 Difference]: Finished difference Result 709 states and 2008 transitions. [2021-06-05 14:53:38,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 14:53:38,816 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 14:53:38,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:53:38,817 INFO L225 Difference]: With dead ends: 709 [2021-06-05 14:53:38,817 INFO L226 Difference]: Without dead ends: 664 [2021-06-05 14:53:38,817 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 3917.3ms TimeCoverageRelationStatistics Valid=185, Invalid=937, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 14:53:38,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2021-06-05 14:53:38,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 437. [2021-06-05 14:53:38,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 3.0573394495412844) internal successors, (1333), 436 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:53:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1333 transitions. [2021-06-05 14:53:38,822 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1333 transitions. Word has length 20 [2021-06-05 14:53:38,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:53:38,822 INFO L482 AbstractCegarLoop]: Abstraction has 437 states and 1333 transitions. [2021-06-05 14:53:38,822 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 14:53:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1333 transitions. [2021-06-05 14:53:38,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:53:38,823 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:53:38,823 INFO L521 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 14:53:39,023 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 255 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6296 [2021-06-05 14:53:39,023 INFO L430 AbstractCegarLoop]: === Iteration 446 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:53:39,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:53:39,023 INFO L82 PathProgramCache]: Analyzing trace with hash 169929870, now seen corresponding path program 54 times [2021-06-05 14:53:39,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:53:39,024 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052338472] [2021-06-05 14:53:39,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:53:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:53:39,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 14:53:39,297 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:53:39,297 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052338472] [2021-06-05 14:53:39,297 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052338472] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:53:39,297 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962796075] [2021-06-05 14:53:39,297 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 14:53:39,330 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:53:39,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:53:39,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:53:39,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:53:39,626 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:39,626 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:39,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:39,627 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:39,631 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:39,631 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:39,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:39,632 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:39,636 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:39,636 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:39,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:39,637 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:39,641 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:39,641 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:39,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:39,642 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:39,646 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:39,646 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:39,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:39,647 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:39,651 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:39,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:39,652 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:39,919 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2021-06-05 14:53:39,919 INFO L628 ElimStorePlain]: treesize reduction 389, result has 47.2 percent of original size [2021-06-05 14:53:39,923 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:39,923 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:39,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:39,924 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:39,927 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:39,928 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:39,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:39,929 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:39,931 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:39,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:39,932 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:40,134 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2021-06-05 14:53:40,134 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 14:53:40,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:40,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:40,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 14:53:40,138 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:40,141 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:40,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:40,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:40,143 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:40,145 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:40,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 23 treesize of output 17 [2021-06-05 14:53:40,146 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:40,333 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2021-06-05 14:53:40,333 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 14:53:40,338 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 14:53:40,339 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:841, output treesize:228 [2021-06-05 14:53:40,760 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 66 [2021-06-05 14:53:41,099 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 14:53:41,099 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962796075] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:53:41,099 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:53:41,099 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:53:41,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762282704] [2021-06-05 14:53:41,100 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:53:41,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:53:41,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:53:41,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:53:41,100 INFO L87 Difference]: Start difference. First operand 437 states and 1333 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 14:53:41,565 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2021-06-05 14:53:41,863 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 116 [2021-06-05 14:53:42,391 WARN L205 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 128 [2021-06-05 14:53:42,972 WARN L205 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 136 [2021-06-05 14:53:43,161 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2021-06-05 14:53:43,378 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2021-06-05 14:53:43,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:53:43,398 INFO L93 Difference]: Finished difference Result 597 states and 1754 transitions. [2021-06-05 14:53:43,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:53:43,399 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 14:53:43,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:53:43,400 INFO L225 Difference]: With dead ends: 597 [2021-06-05 14:53:43,400 INFO L226 Difference]: Without dead ends: 570 [2021-06-05 14:53:43,400 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 2757.4ms TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:53:43,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-06-05 14:53:43,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 440. [2021-06-05 14:53:43,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.0546697038724373) internal successors, (1341), 439 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:53:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1341 transitions. [2021-06-05 14:53:43,404 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1341 transitions. Word has length 20 [2021-06-05 14:53:43,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:53:43,404 INFO L482 AbstractCegarLoop]: Abstraction has 440 states and 1341 transitions. [2021-06-05 14:53:43,405 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 14:53:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1341 transitions. [2021-06-05 14:53:43,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:53:43,405 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:53:43,405 INFO L521 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 14:53:43,605 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6334,256 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:53:43,605 INFO L430 AbstractCegarLoop]: === Iteration 447 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:53:43,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:53:43,606 INFO L82 PathProgramCache]: Analyzing trace with hash -146181486, now seen corresponding path program 55 times [2021-06-05 14:53:43,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:53:43,606 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973528753] [2021-06-05 14:53:43,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:53:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:53:43,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 14:53:43,870 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:53:43,870 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973528753] [2021-06-05 14:53:43,870 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973528753] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:53:43,870 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234872959] [2021-06-05 14:53:43,870 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 14:53:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:53:43,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:53:43,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:53:44,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:44,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:44,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:44,196 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:44,201 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:44,201 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:44,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 14:53:44,202 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:44,207 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:44,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:44,208 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:44,495 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 99 [2021-06-05 14:53:44,496 INFO L628 ElimStorePlain]: treesize reduction 120, result has 74.7 percent of original size [2021-06-05 14:53:44,500 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:44,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:44,501 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:44,640 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-06-05 14:53:44,640 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:44,644 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:44,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:44,645 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:44,778 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-06-05 14:53:44,778 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:44,782 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:44,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:44,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 15 treesize of output 11 [2021-06-05 14:53:44,784 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:44,787 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:44,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:44,788 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:44,917 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-06-05 14:53:44,917 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:44,921 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:44,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:44,922 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:45,050 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-05 14:53:45,051 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:45,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:45,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:45,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 23 treesize of output 17 [2021-06-05 14:53:45,056 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:45,060 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:45,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:45,061 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:45,176 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2021-06-05 14:53:45,176 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:45,182 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 14:53:45,182 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:561, output treesize:265 [2021-06-05 14:53:45,395 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 95 [2021-06-05 14:53:45,638 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2021-06-05 14:53:46,498 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1140, get_6, v_prenex_1142, v_prenex_1144, v_prenex_1136, v_prenex_1146, v_prenex_1138], 1=[v_prenex_1141, v_prenex_1143, v_prenex_1145, v_prenex_1147, get_0, v_prenex_1137, v_prenex_1139]} [2021-06-05 14:53:46,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 24 treesize of output 18 [2021-06-05 14:53:46,509 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:46,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 25 treesize of output 19 [2021-06-05 14:53:46,519 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:46,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 32 treesize of output 24 [2021-06-05 14:53:46,528 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:46,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:46,537 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:46,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 31 treesize of output 23 [2021-06-05 14:53:46,546 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:46,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 24 treesize of output 18 [2021-06-05 14:53:46,556 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:47,060 WARN L205 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 105 [2021-06-05 14:53:47,061 INFO L628 ElimStorePlain]: treesize reduction 1756, result has 17.1 percent of original size [2021-06-05 14:53:47,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:47,067 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:47,200 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-06-05 14:53:47,200 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:47,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 14:53:47,206 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:47,342 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-06-05 14:53:47,342 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:47,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 16 treesize of output 12 [2021-06-05 14:53:47,347 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:47,472 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 14:53:47,472 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:47,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:47,478 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:47,601 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-05 14:53:47,601 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:47,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 14:53:47,606 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:47,724 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-06-05 14:53:47,724 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:47,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 16 treesize of output 12 [2021-06-05 14:53:47,729 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:47,847 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-06-05 14:53:47,847 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:47,847 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1141 vanished before elimination [2021-06-05 14:53:47,847 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1143 vanished before elimination [2021-06-05 14:53:47,847 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1145 vanished before elimination [2021-06-05 14:53:47,847 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1147 vanished before elimination [2021-06-05 14:53:47,847 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 14:53:47,847 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1137 vanished before elimination [2021-06-05 14:53:47,848 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1139 vanished before elimination [2021-06-05 14:53:47,851 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 14:53:47,851 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 21 variables, input treesize:2293, output treesize:253 [2021-06-05 14:53:48,165 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2021-06-05 14:53:48,318 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 14:53:48,319 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234872959] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:53:48,320 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:53:48,320 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:53:48,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558936175] [2021-06-05 14:53:48,320 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:53:48,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:53:48,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:53:48,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:53:48,320 INFO L87 Difference]: Start difference. First operand 440 states and 1341 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 14:53:49,143 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 129 [2021-06-05 14:53:49,762 WARN L205 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 142 [2021-06-05 14:53:50,084 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2021-06-05 14:53:50,457 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 87 [2021-06-05 14:53:50,926 WARN L205 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 98 [2021-06-05 14:53:50,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:53:50,941 INFO L93 Difference]: Finished difference Result 618 states and 1797 transitions. [2021-06-05 14:53:50,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:53:50,941 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 14:53:50,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:53:50,942 INFO L225 Difference]: With dead ends: 618 [2021-06-05 14:53:50,942 INFO L226 Difference]: Without dead ends: 597 [2021-06-05 14:53:50,942 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 3365.5ms TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:53:50,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2021-06-05 14:53:50,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 443. [2021-06-05 14:53:50,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 3.0520361990950224) internal successors, (1349), 442 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:53:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1349 transitions. [2021-06-05 14:53:50,946 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1349 transitions. Word has length 20 [2021-06-05 14:53:50,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:53:50,946 INFO L482 AbstractCegarLoop]: Abstraction has 443 states and 1349 transitions. [2021-06-05 14:53:50,946 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 14:53:50,947 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1349 transitions. [2021-06-05 14:53:50,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:53:50,947 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:53:50,947 INFO L521 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 14:53:51,149 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 257 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6420 [2021-06-05 14:53:51,149 INFO L430 AbstractCegarLoop]: === Iteration 448 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:53:51,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:53:51,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1844901874, now seen corresponding path program 56 times [2021-06-05 14:53:51,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:53:51,150 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538241365] [2021-06-05 14:53:51,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:53:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:53:51,618 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 14:53:51,618 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:53:51,618 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538241365] [2021-06-05 14:53:51,618 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538241365] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:53:51,618 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087668007] [2021-06-05 14:53:51,618 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 14:53:51,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:53:51,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:53:51,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:53:51,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:53:52,169 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:52,170 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:52,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:52,171 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:52,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:52,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:52,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 22 treesize of output 16 [2021-06-05 14:53:52,176 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:52,180 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:52,181 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:52,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 30 treesize of output 22 [2021-06-05 14:53:52,182 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:52,186 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:52,186 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:52,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 22 treesize of output 16 [2021-06-05 14:53:52,187 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:52,191 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:52,191 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:52,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 23 treesize of output 17 [2021-06-05 14:53:52,192 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:52,196 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:52,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:52,197 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:52,537 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2021-06-05 14:53:52,538 INFO L628 ElimStorePlain]: treesize reduction 451, result has 48.2 percent of original size [2021-06-05 14:53:52,541 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:52,542 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:52,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 14:53:52,543 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:52,546 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:52,547 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:52,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:52,548 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:52,551 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:52,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 23 treesize of output 17 [2021-06-05 14:53:52,552 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:52,829 WARN L205 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2021-06-05 14:53:52,830 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.7 percent of original size [2021-06-05 14:53:52,833 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:52,834 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:52,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 14:53:52,835 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:52,838 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:52,839 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:52,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:53:52,840 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:52,843 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:53:52,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 30 treesize of output 22 [2021-06-05 14:53:52,844 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:53,076 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2021-06-05 14:53:53,076 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.7 percent of original size [2021-06-05 14:53:53,082 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 14:53:53,083 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:985, output treesize:296 [2021-06-05 14:53:53,704 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 126 [2021-06-05 14:53:54,034 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1181, v_prenex_1191, v_prenex_1193, v_prenex_1171, v_prenex_1195, v_prenex_1173, v_prenex_1187, get_6, v_prenex_1175, v_prenex_1189, v_prenex_1200, v_prenex_1179], 1=[v_prenex_1192, v_prenex_1180, v_prenex_1194, v_prenex_1172, v_prenex_1182, v_prenex_1196, v_prenex_1174, v_prenex_1176, v_prenex_1188, v_prenex_1201, get_0, v_prenex_1190]} [2021-06-05 14:53:54,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:54,045 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:54,483 WARN L205 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 96 [2021-06-05 14:53:54,484 INFO L628 ElimStorePlain]: treesize reduction 1034, result has 26.1 percent of original size [2021-06-05 14:53:54,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 7 treesize of output 5 [2021-06-05 14:53:54,489 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:54,625 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-06-05 14:53:54,626 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:54,626 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1193 vanished before elimination [2021-06-05 14:53:54,626 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1171 vanished before elimination [2021-06-05 14:53:54,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 7 treesize of output 5 [2021-06-05 14:53:54,631 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:54,760 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 14:53:54,760 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:54,760 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1173 vanished before elimination [2021-06-05 14:53:54,761 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1187 vanished before elimination [2021-06-05 14:53:54,761 INFO L518 ElimStorePlain]: Eliminatee get_6 vanished before elimination [2021-06-05 14:53:54,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:53:54,766 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:54,892 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-05 14:53:54,892 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:54,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 7 treesize of output 5 [2021-06-05 14:53:54,897 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:55,022 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-06-05 14:53:55,022 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:55,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 7 treesize of output 5 [2021-06-05 14:53:55,026 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:53:55,146 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-06-05 14:53:55,146 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:53:55,146 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1179 vanished before elimination [2021-06-05 14:53:55,147 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1192 vanished before elimination [2021-06-05 14:53:55,147 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1180 vanished before elimination [2021-06-05 14:53:55,147 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1194 vanished before elimination [2021-06-05 14:53:55,147 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1172 vanished before elimination [2021-06-05 14:53:55,147 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1182 vanished before elimination [2021-06-05 14:53:55,147 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1196 vanished before elimination [2021-06-05 14:53:55,147 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1174 vanished before elimination [2021-06-05 14:53:55,147 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1176 vanished before elimination [2021-06-05 14:53:55,147 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1188 vanished before elimination [2021-06-05 14:53:55,147 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1201 vanished before elimination [2021-06-05 14:53:55,147 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 14:53:55,147 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1190 vanished before elimination [2021-06-05 14:53:55,151 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 14:53:55,151 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 36 variables, input treesize:1407, output treesize:283 [2021-06-05 14:53:55,285 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2021-06-05 14:53:55,462 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2021-06-05 14:53:55,546 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 14:53:55,546 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087668007] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:53:55,546 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:53:55,546 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:53:55,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865788502] [2021-06-05 14:53:55,546 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:53:55,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:53:55,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:53:55,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:53:55,546 INFO L87 Difference]: Start difference. First operand 443 states and 1349 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 14:53:56,054 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 137 [2021-06-05 14:53:57,127 WARN L205 SmtUtils]: Spent 951.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 222 [2021-06-05 14:53:57,478 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 105 [2021-06-05 14:53:57,810 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2021-06-05 14:53:58,081 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 113 [2021-06-05 14:53:58,336 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2021-06-05 14:53:58,544 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 80 [2021-06-05 14:53:59,096 WARN L205 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 93 [2021-06-05 14:53:59,304 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 96 [2021-06-05 14:53:59,973 WARN L205 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 102 [2021-06-05 14:53:59,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:53:59,997 INFO L93 Difference]: Finished difference Result 684 states and 1967 transitions. [2021-06-05 14:53:59,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 14:53:59,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 14:53:59,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:53:59,998 INFO L225 Difference]: With dead ends: 684 [2021-06-05 14:53:59,999 INFO L226 Difference]: Without dead ends: 567 [2021-06-05 14:53:59,999 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 5420.8ms TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2021-06-05 14:53:59,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-06-05 14:54:00,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 437. [2021-06-05 14:54:00,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 3.055045871559633) internal successors, (1332), 436 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:54:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1332 transitions. [2021-06-05 14:54:00,003 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1332 transitions. Word has length 20 [2021-06-05 14:54:00,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:54:00,003 INFO L482 AbstractCegarLoop]: Abstraction has 437 states and 1332 transitions. [2021-06-05 14:54:00,003 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 14:54:00,003 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1332 transitions. [2021-06-05 14:54:00,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:54:00,004 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:54:00,004 INFO L521 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 14:54:00,219 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6712,258 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:54:00,219 INFO L430 AbstractCegarLoop]: === Iteration 449 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:54:00,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:54:00,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1265307084, now seen corresponding path program 57 times [2021-06-05 14:54:00,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:54:00,219 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398677233] [2021-06-05 14:54:00,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:54:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:54:00,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 14:54:00,433 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:54:00,433 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398677233] [2021-06-05 14:54:00,433 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398677233] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:54:00,433 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939309054] [2021-06-05 14:54:00,433 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 14:54:00,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:54:00,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:54:00,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:54:00,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:54:00,749 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:00,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:00,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 31 treesize of output 23 [2021-06-05 14:54:00,751 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:00,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:00,756 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:00,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 31 treesize of output 23 [2021-06-05 14:54:00,757 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:00,761 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:00,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:00,762 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:00,991 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2021-06-05 14:54:00,992 INFO L628 ElimStorePlain]: treesize reduction 108, result has 74.3 percent of original size [2021-06-05 14:54:00,996 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:00,996 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:00,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:00,997 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:01,001 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:01,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:01,002 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:01,108 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-06-05 14:54:01,109 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:01,112 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:01,113 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:01,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 15 treesize of output 11 [2021-06-05 14:54:01,114 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:01,117 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:01,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 23 treesize of output 17 [2021-06-05 14:54:01,118 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:01,217 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:01,220 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:01,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:01,221 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:01,318 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:01,322 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:01,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 14:54:01,323 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:01,417 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:01,420 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:01,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:01,421 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:01,516 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:01,522 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 14:54:01,522 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:525, output treesize:238 [2021-06-05 14:54:01,707 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2021-06-05 14:54:02,200 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 14:54:02,200 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939309054] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:54:02,200 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:54:02,200 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:54:02,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020719647] [2021-06-05 14:54:02,200 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:54:02,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:54:02,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:54:02,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:54:02,201 INFO L87 Difference]: Start difference. First operand 437 states and 1332 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 14:54:02,611 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 106 [2021-06-05 14:54:02,896 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2021-06-05 14:54:03,260 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2021-06-05 14:54:03,460 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2021-06-05 14:54:03,795 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2021-06-05 14:54:04,310 WARN L205 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2021-06-05 14:54:04,440 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2021-06-05 14:54:04,618 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2021-06-05 14:54:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:54:04,619 INFO L93 Difference]: Finished difference Result 837 states and 2315 transitions. [2021-06-05 14:54:04,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 14:54:04,619 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 14:54:04,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:54:04,620 INFO L225 Difference]: With dead ends: 837 [2021-06-05 14:54:04,620 INFO L226 Difference]: Without dead ends: 801 [2021-06-05 14:54:04,620 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 2837.9ms TimeCoverageRelationStatistics Valid=167, Invalid=763, Unknown=0, NotChecked=0, Total=930 [2021-06-05 14:54:04,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2021-06-05 14:54:04,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 445. [2021-06-05 14:54:04,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 3.0833333333333335) internal successors, (1369), 444 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 14:54:04,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1369 transitions. [2021-06-05 14:54:04,626 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1369 transitions. Word has length 20 [2021-06-05 14:54:04,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:54:04,626 INFO L482 AbstractCegarLoop]: Abstraction has 445 states and 1369 transitions. [2021-06-05 14:54:04,626 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 14:54:04,626 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1369 transitions. [2021-06-05 14:54:04,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:54:04,627 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:54:04,627 INFO L521 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 14:54:04,827 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6843,259 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:54:04,827 INFO L430 AbstractCegarLoop]: === Iteration 450 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:54:04,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:54:04,827 INFO L82 PathProgramCache]: Analyzing trace with hash 46671724, now seen corresponding path program 58 times [2021-06-05 14:54:04,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:54:04,828 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555623798] [2021-06-05 14:54:04,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:54:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:54:05,115 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 14:54:05,115 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:54:05,115 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555623798] [2021-06-05 14:54:05,116 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555623798] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:54:05,116 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923169164] [2021-06-05 14:54:05,116 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 14:54:05,141 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:54:05,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:54:05,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:54:05,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:54:05,429 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:05,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:05,430 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:05,710 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2021-06-05 14:54:05,710 INFO L628 ElimStorePlain]: treesize reduction 170, result has 67.2 percent of original size [2021-06-05 14:54:05,714 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:05,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 14:54:05,715 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:05,834 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 14:54:05,835 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:05,838 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:05,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:05,839 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:05,955 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 14:54:05,955 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:05,959 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:05,960 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:05,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:05,960 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:05,964 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:05,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:05,965 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:06,078 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 14:54:06,078 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:06,082 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:06,082 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:06,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 31 treesize of output 23 [2021-06-05 14:54:06,084 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:06,087 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:06,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 14:54:06,088 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:06,189 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-06-05 14:54:06,189 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:06,193 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:06,194 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:06,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 14:54:06,195 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:06,198 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:06,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:06,199 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:06,292 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:06,298 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 14:54:06,298 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:525, output treesize:238 [2021-06-05 14:54:06,492 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2021-06-05 14:54:06,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 14:54:06,986 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923169164] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:54:06,986 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:54:06,986 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:54:06,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634711256] [2021-06-05 14:54:06,986 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:54:06,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:54:06,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:54:06,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:54:06,987 INFO L87 Difference]: Start difference. First operand 445 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 14:54:07,412 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2021-06-05 14:54:07,729 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 124 [2021-06-05 14:54:08,006 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2021-06-05 14:54:08,392 WARN L205 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 82 [2021-06-05 14:54:08,989 WARN L205 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2021-06-05 14:54:09,647 WARN L205 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 95 [2021-06-05 14:54:10,209 WARN L205 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 99 [2021-06-05 14:54:10,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:54:10,218 INFO L93 Difference]: Finished difference Result 720 states and 2052 transitions. [2021-06-05 14:54:10,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 14:54:10,218 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 14:54:10,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:54:10,219 INFO L225 Difference]: With dead ends: 720 [2021-06-05 14:54:10,219 INFO L226 Difference]: Without dead ends: 690 [2021-06-05 14:54:10,219 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 3653.3ms TimeCoverageRelationStatistics Valid=159, Invalid=771, Unknown=0, NotChecked=0, Total=930 [2021-06-05 14:54:10,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2021-06-05 14:54:10,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 445. [2021-06-05 14:54:10,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 3.0833333333333335) internal successors, (1369), 444 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 14:54:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1369 transitions. [2021-06-05 14:54:10,224 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1369 transitions. Word has length 20 [2021-06-05 14:54:10,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:54:10,224 INFO L482 AbstractCegarLoop]: Abstraction has 445 states and 1369 transitions. [2021-06-05 14:54:10,224 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 14:54:10,225 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1369 transitions. [2021-06-05 14:54:10,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:54:10,225 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:54:10,225 INFO L521 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 14:54:10,425 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6938,260 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:54:10,425 INFO L430 AbstractCegarLoop]: === Iteration 451 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:54:10,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:54:10,426 INFO L82 PathProgramCache]: Analyzing trace with hash -2040599664, now seen corresponding path program 59 times [2021-06-05 14:54:10,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:54:10,426 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214171994] [2021-06-05 14:54:10,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:54:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:54:10,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 14:54:10,744 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:54:10,744 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214171994] [2021-06-05 14:54:10,744 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214171994] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:54:10,744 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426896092] [2021-06-05 14:54:10,744 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 14:54:10,770 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:54:10,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:54:10,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:54:10,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:54:10,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 38 treesize of output 28 [2021-06-05 14:54:10,916 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:10,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 44 treesize of output 32 [2021-06-05 14:54:10,921 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:10,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 37 treesize of output 27 [2021-06-05 14:54:10,925 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:10,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 29 treesize of output 21 [2021-06-05 14:54:10,929 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:10,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 37 treesize of output 27 [2021-06-05 14:54:10,933 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:10,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 38 treesize of output 28 [2021-06-05 14:54:10,937 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:10,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 43 treesize of output 31 [2021-06-05 14:54:10,941 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:10,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 31 treesize of output 23 [2021-06-05 14:54:10,946 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:10,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 14:54:10,950 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:10,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 38 treesize of output 28 [2021-06-05 14:54:10,954 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:10,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 29 treesize of output 21 [2021-06-05 14:54:10,958 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:10,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 14:54:10,962 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:10,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 44 treesize of output 32 [2021-06-05 14:54:10,966 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:10,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 37 treesize of output 27 [2021-06-05 14:54:10,971 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:10,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 14:54:10,975 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:10,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 45 treesize of output 33 [2021-06-05 14:54:10,979 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:10,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:10,983 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:10,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 36 treesize of output 26 [2021-06-05 14:54:10,987 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:10,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 14:54:10,991 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:10,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 30 treesize of output 22 [2021-06-05 14:54:10,995 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:10,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 30 treesize of output 22 [2021-06-05 14:54:10,999 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:11,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:11,002 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:11,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 36 treesize of output 26 [2021-06-05 14:54:11,006 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:11,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 37 treesize of output 27 [2021-06-05 14:54:11,010 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:11,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 30 treesize of output 22 [2021-06-05 14:54:11,014 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:11,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 37 treesize of output 27 [2021-06-05 14:54:11,018 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:11,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:11,022 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:11,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 36 treesize of output 26 [2021-06-05 14:54:11,026 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:11,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:11,030 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:11,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 29 treesize of output 21 [2021-06-05 14:54:11,034 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:11,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:11,038 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:11,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 30 treesize of output 22 [2021-06-05 14:54:11,041 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:11,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:11,045 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:11,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 37 treesize of output 27 [2021-06-05 14:54:11,049 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:11,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 36 treesize of output 26 [2021-06-05 14:54:11,052 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:11,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:11,056 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:11,211 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2021-06-05 14:54:11,211 INFO L628 ElimStorePlain]: treesize reduction 313, result has 38.3 percent of original size [2021-06-05 14:54:11,213 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:54:11,213 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1729, output treesize:194 [2021-06-05 14:54:11,575 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2021-06-05 14:54:11,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 14:54:11,727 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426896092] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:54:11,728 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:54:11,728 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:54:11,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072708114] [2021-06-05 14:54:11,728 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:54:11,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:54:11,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:54:11,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:54:11,728 INFO L87 Difference]: Start difference. First operand 445 states and 1369 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 14:54:12,360 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2021-06-05 14:54:12,618 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2021-06-05 14:54:12,930 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2021-06-05 14:54:13,397 WARN L205 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2021-06-05 14:54:13,647 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 82 [2021-06-05 14:54:14,183 WARN L205 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 89 [2021-06-05 14:54:14,418 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2021-06-05 14:54:14,704 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2021-06-05 14:54:15,016 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2021-06-05 14:54:15,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:54:15,034 INFO L93 Difference]: Finished difference Result 718 states and 2046 transitions. [2021-06-05 14:54:15,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 14:54:15,034 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 14:54:15,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:54:15,035 INFO L225 Difference]: With dead ends: 718 [2021-06-05 14:54:15,035 INFO L226 Difference]: Without dead ends: 697 [2021-06-05 14:54:15,035 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 3712.1ms TimeCoverageRelationStatistics Valid=178, Invalid=878, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 14:54:15,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2021-06-05 14:54:15,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 448. [2021-06-05 14:54:15,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 3.087248322147651) internal successors, (1380), 447 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:54:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1380 transitions. [2021-06-05 14:54:15,041 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1380 transitions. Word has length 20 [2021-06-05 14:54:15,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:54:15,041 INFO L482 AbstractCegarLoop]: Abstraction has 448 states and 1380 transitions. [2021-06-05 14:54:15,041 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 14:54:15,041 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1380 transitions. [2021-06-05 14:54:15,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:54:15,041 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:54:15,041 INFO L521 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 14:54:15,242 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 261 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7033 [2021-06-05 14:54:15,242 INFO L430 AbstractCegarLoop]: === Iteration 452 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:54:15,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:54:15,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1084178636, now seen corresponding path program 60 times [2021-06-05 14:54:15,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:54:15,242 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173276757] [2021-06-05 14:54:15,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:54:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:54:15,636 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 14:54:15,637 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:54:15,637 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173276757] [2021-06-05 14:54:15,637 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173276757] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:54:15,637 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020545806] [2021-06-05 14:54:15,637 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 14:54:15,663 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:54:15,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:54:15,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:54:15,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:54:15,990 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:15,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 23 treesize of output 17 [2021-06-05 14:54:15,991 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:16,332 WARN L205 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 114 [2021-06-05 14:54:16,333 INFO L628 ElimStorePlain]: treesize reduction 194, result has 68.4 percent of original size [2021-06-05 14:54:16,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:16,338 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:16,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:16,339 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:16,343 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:16,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 15 treesize of output 11 [2021-06-05 14:54:16,344 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:16,496 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-05 14:54:16,496 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:16,501 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:16,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:16,502 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:16,652 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-05 14:54:16,652 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:16,657 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:16,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:16,658 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:16,806 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-05 14:54:16,806 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:16,814 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:16,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:16,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 23 treesize of output 17 [2021-06-05 14:54:16,816 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:16,820 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:16,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:16,821 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:16,955 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-06-05 14:54:16,956 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:16,960 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:16,960 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:16,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:16,961 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:16,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:16,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:16,966 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:17,102 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 14:54:17,102 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:17,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 14:54:17,110 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:621, output treesize:316 [2021-06-05 14:54:17,336 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2021-06-05 14:54:17,599 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1251, get_6, v_prenex_1253, v_prenex_1255, v_prenex_1245, v_prenex_1247, v_prenex_1249], 1=[v_prenex_1250, v_prenex_1252, v_prenex_1254, v_prenex_1246, v_prenex_1256, get_0, v_prenex_1248]} [2021-06-05 14:54:17,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:17,609 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:17,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 38 treesize of output 28 [2021-06-05 14:54:17,618 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:17,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 31 treesize of output 23 [2021-06-05 14:54:17,626 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:54: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 30 treesize of output 22 [2021-06-05 14:54:17,635 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:17,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:17,644 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:17,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 14:54:17,652 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:18,196 WARN L205 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 112 [2021-06-05 14:54:18,197 INFO L628 ElimStorePlain]: treesize reduction 1795, result has 16.6 percent of original size [2021-06-05 14:54:18,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:18,203 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:18,336 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-06-05 14:54:18,337 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:18,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:18,342 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:18,474 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-06-05 14:54:18,474 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:18,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 9 treesize of output 7 [2021-06-05 14:54:18,480 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:18,622 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-06-05 14:54:18,622 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:18,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:18,627 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:18,780 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-06-05 14:54:18,780 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:18,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:18,786 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:18,923 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-06-05 14:54:18,923 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:18,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 14:54:18,928 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:19,071 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-06-05 14:54:19,071 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:19,072 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1250 vanished before elimination [2021-06-05 14:54:19,072 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1252 vanished before elimination [2021-06-05 14:54:19,072 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1254 vanished before elimination [2021-06-05 14:54:19,072 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1246 vanished before elimination [2021-06-05 14:54:19,072 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1256 vanished before elimination [2021-06-05 14:54:19,072 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 14:54:19,072 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1248 vanished before elimination [2021-06-05 14:54:19,076 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 14:54:19,076 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 21 variables, input treesize:2353, output treesize:289 [2021-06-05 14:54:19,331 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2021-06-05 14:54:19,831 WARN L205 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2021-06-05 14:54:20,061 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 14:54:20,061 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020545806] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:54:20,061 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:54:20,061 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:54:20,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443458636] [2021-06-05 14:54:20,062 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:54:20,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:54:20,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:54:20,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:54:20,062 INFO L87 Difference]: Start difference. First operand 448 states and 1380 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 14:54:20,554 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 138 [2021-06-05 14:54:20,930 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2021-06-05 14:54:21,497 WARN L205 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 89 [2021-06-05 14:54:22,139 WARN L205 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 94 [2021-06-05 14:54:22,408 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 88 [2021-06-05 14:54:23,099 WARN L205 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 101 [2021-06-05 14:54:23,360 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 81 [2021-06-05 14:54:23,518 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2021-06-05 14:54:23,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:54:23,533 INFO L93 Difference]: Finished difference Result 686 states and 1984 transitions. [2021-06-05 14:54:23,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 14:54:23,534 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 14:54:23,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:54:23,534 INFO L225 Difference]: With dead ends: 686 [2021-06-05 14:54:23,535 INFO L226 Difference]: Without dead ends: 671 [2021-06-05 14:54:23,535 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 4613.0ms TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:54:23,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2021-06-05 14:54:23,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 445. [2021-06-05 14:54:23,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 3.0833333333333335) internal successors, (1369), 444 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 14:54:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1369 transitions. [2021-06-05 14:54:23,540 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1369 transitions. Word has length 20 [2021-06-05 14:54:23,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:54:23,540 INFO L482 AbstractCegarLoop]: Abstraction has 445 states and 1369 transitions. [2021-06-05 14:54:23,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 14:54:23,540 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1369 transitions. [2021-06-05 14:54:23,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:54:23,540 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:54:23,540 INFO L521 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 14:54:23,741 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7066,262 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:54:23,741 INFO L430 AbstractCegarLoop]: === Iteration 453 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:54:23,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:54:23,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1067241584, now seen corresponding path program 61 times [2021-06-05 14:54:23,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:54:23,741 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531135987] [2021-06-05 14:54:23,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:54:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:54:24,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 14:54:24,128 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:54:24,128 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531135987] [2021-06-05 14:54:24,128 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531135987] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:54:24,128 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122263294] [2021-06-05 14:54:24,128 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 14:54:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:54:24,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:54:24,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:54:24,493 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:24,494 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:24,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 23 treesize of output 17 [2021-06-05 14:54:24,495 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:24,499 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:24,500 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:24,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:24,501 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:24,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:24,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:24,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:24,511 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:24,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:24,516 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:24,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 22 treesize of output 16 [2021-06-05 14:54:24,516 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:24,521 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:24,521 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:24,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:24,522 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:24,526 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:24,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:24,527 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:24,807 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2021-06-05 14:54:24,807 INFO L628 ElimStorePlain]: treesize reduction 347, result has 49.0 percent of original size [2021-06-05 14:54:24,811 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:24,811 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:24,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 23 treesize of output 17 [2021-06-05 14:54:24,812 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:24,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:24,816 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:24,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:24,817 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:24,820 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:24,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 30 treesize of output 22 [2021-06-05 14:54:24,821 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:25,059 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2021-06-05 14:54:25,059 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 14:54:25,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:25,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:25,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:25,064 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:25,067 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:25,067 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:25,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:25,068 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:25,071 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:25,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 22 treesize of output 16 [2021-06-05 14:54:25,072 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:25,171 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:25,177 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 14:54:25,177 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:841, output treesize:235 [2021-06-05 14:54:25,816 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 14:54:25,816 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122263294] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:54:25,816 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:54:25,816 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:54:25,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966401138] [2021-06-05 14:54:25,817 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:54:25,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:54:25,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:54:25,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:54:25,817 INFO L87 Difference]: Start difference. First operand 445 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 14:54:26,326 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2021-06-05 14:54:26,678 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 125 [2021-06-05 14:54:27,080 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2021-06-05 14:54:27,493 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 82 [2021-06-05 14:54:27,642 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2021-06-05 14:54:28,049 WARN L205 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 88 [2021-06-05 14:54:28,277 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2021-06-05 14:54:28,815 WARN L205 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 98 [2021-06-05 14:54:28,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:54:28,875 INFO L93 Difference]: Finished difference Result 680 states and 1981 transitions. [2021-06-05 14:54:28,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:54:28,875 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 14:54:28,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:54:28,876 INFO L225 Difference]: With dead ends: 680 [2021-06-05 14:54:28,876 INFO L226 Difference]: Without dead ends: 665 [2021-06-05 14:54:28,876 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 3413.5ms TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2021-06-05 14:54:28,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2021-06-05 14:54:28,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 447. [2021-06-05 14:54:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 3.0896860986547083) internal successors, (1378), 446 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:54:28,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1378 transitions. [2021-06-05 14:54:28,886 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1378 transitions. Word has length 20 [2021-06-05 14:54:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:54:28,886 INFO L482 AbstractCegarLoop]: Abstraction has 447 states and 1378 transitions. [2021-06-05 14:54:28,886 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 14:54:28,887 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1378 transitions. [2021-06-05 14:54:28,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:54:28,887 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:54:28,887 INFO L521 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 14:54:29,087 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 263 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7164 [2021-06-05 14:54:29,087 INFO L430 AbstractCegarLoop]: === Iteration 454 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:54:29,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:54:29,088 INFO L82 PathProgramCache]: Analyzing trace with hash -2087441876, now seen corresponding path program 62 times [2021-06-05 14:54:29,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:54:29,088 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465239068] [2021-06-05 14:54:29,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:54:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:54:29,530 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 14:54:29,530 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:54:29,530 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465239068] [2021-06-05 14:54:29,530 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465239068] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:54:29,530 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365732188] [2021-06-05 14:54:29,530 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 14:54:29,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:54:29,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:54:29,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:54:29,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:54:29,861 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:29,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 15 treesize of output 11 [2021-06-05 14:54:29,862 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:30,159 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 101 [2021-06-05 14:54:30,159 INFO L628 ElimStorePlain]: treesize reduction 179, result has 67.7 percent of original size [2021-06-05 14:54:30,164 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:30,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 14:54:30,165 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:30,306 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-06-05 14:54:30,307 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:30,311 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:30,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 14:54:30,312 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:30,452 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-06-05 14:54:30,452 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:30,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:30,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:30,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 14:54:30,457 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:30,461 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:30,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:30,462 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:30,596 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-06-05 14:54:30,596 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:30,600 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:30,600 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:30,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 15 treesize of output 11 [2021-06-05 14:54:30,601 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:30,605 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:30,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:30,606 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:30,735 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-05 14:54:30,735 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:30,739 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:30,739 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:30,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 23 treesize of output 17 [2021-06-05 14:54:30,740 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:30,744 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:30,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 31 treesize of output 23 [2021-06-05 14:54:30,745 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:30,855 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2021-06-05 14:54:30,855 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:30,861 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 14:54:30,861 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:561, output treesize:265 [2021-06-05 14:54:31,068 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 95 [2021-06-05 14:54:31,745 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1291, v_prenex_1281, v_prenex_1283, get_6, v_prenex_1285, v_prenex_1287, v_prenex_1289], 1=[v_prenex_1290, v_prenex_1282, v_prenex_1292, v_prenex_1284, v_prenex_1286, v_prenex_1288, get_0]} [2021-06-05 14:54:31,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:31,754 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:31,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 23 treesize of output 17 [2021-06-05 14:54:31,763 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:31,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:31,772 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:31,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:31,781 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:31,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:31,789 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:31,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 14:54:31,798 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:32,298 WARN L205 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 103 [2021-06-05 14:54:32,298 INFO L628 ElimStorePlain]: treesize reduction 1740, result has 17.3 percent of original size [2021-06-05 14:54:32,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:32,304 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:32,437 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-06-05 14:54:32,437 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:32,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 16 treesize of output 12 [2021-06-05 14:54:32,443 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:32,571 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-06-05 14:54:32,572 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:32,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 15 treesize of output 11 [2021-06-05 14:54:32,577 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:32,702 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-05 14:54:32,702 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:32,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 9 treesize of output 7 [2021-06-05 14:54:32,708 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:32,833 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-06-05 14:54:32,833 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:32,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 9 treesize of output 7 [2021-06-05 14:54:32,838 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:32,964 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-06-05 14:54:32,964 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:32,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 7 treesize of output 5 [2021-06-05 14:54:32,968 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:33,086 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-06-05 14:54:33,087 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:33,087 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1290 vanished before elimination [2021-06-05 14:54:33,087 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1282 vanished before elimination [2021-06-05 14:54:33,087 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1292 vanished before elimination [2021-06-05 14:54:33,087 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1284 vanished before elimination [2021-06-05 14:54:33,087 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1286 vanished before elimination [2021-06-05 14:54:33,087 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1288 vanished before elimination [2021-06-05 14:54:33,087 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 14:54:33,091 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 14:54:33,091 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 21 variables, input treesize:2269, output treesize:254 [2021-06-05 14:54:33,696 WARN L205 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2021-06-05 14:54:33,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 14:54:33,896 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365732188] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:54:33,896 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:54:33,896 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:54:33,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381949563] [2021-06-05 14:54:33,896 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:54:33,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:54:33,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:54:33,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:54:33,896 INFO L87 Difference]: Start difference. First operand 447 states and 1378 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 14:54:34,175 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2021-06-05 14:54:34,787 WARN L205 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 133 [2021-06-05 14:54:35,237 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 77 [2021-06-05 14:54:35,815 WARN L205 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 89 [2021-06-05 14:54:35,954 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2021-06-05 14:54:36,595 WARN L205 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 96 [2021-06-05 14:54:36,762 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2021-06-05 14:54:37,482 WARN L205 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 103 [2021-06-05 14:54:37,762 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2021-06-05 14:54:37,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:54:37,825 INFO L93 Difference]: Finished difference Result 670 states and 1973 transitions. [2021-06-05 14:54:37,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 14:54:37,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 14:54:37,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:54:37,826 INFO L225 Difference]: With dead ends: 670 [2021-06-05 14:54:37,826 INFO L226 Difference]: Without dead ends: 655 [2021-06-05 14:54:37,827 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 4813.6ms TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2021-06-05 14:54:37,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2021-06-05 14:54:37,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 445. [2021-06-05 14:54:37,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 3.0833333333333335) internal successors, (1369), 444 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 14:54:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1369 transitions. [2021-06-05 14:54:37,832 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1369 transitions. Word has length 20 [2021-06-05 14:54:37,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:54:37,832 INFO L482 AbstractCegarLoop]: Abstraction has 445 states and 1369 transitions. [2021-06-05 14:54:37,832 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 14:54:37,832 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1369 transitions. [2021-06-05 14:54:37,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:54:37,833 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:54:37,833 INFO L521 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 14:54:38,033 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 264 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7269 [2021-06-05 14:54:38,033 INFO L430 AbstractCegarLoop]: === Iteration 455 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:54:38,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:54:38,033 INFO L82 PathProgramCache]: Analyzing trace with hash -322665892, now seen corresponding path program 63 times [2021-06-05 14:54:38,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:54:38,034 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094958203] [2021-06-05 14:54:38,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:54:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:54:38,348 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 14:54:38,348 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:54:38,348 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094958203] [2021-06-05 14:54:38,348 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094958203] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:54:38,348 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768988719] [2021-06-05 14:54:38,348 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 14:54:38,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:54:38,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:54:38,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:54:38,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:54:38,735 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:38,736 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:38,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 29 treesize of output 21 [2021-06-05 14:54:38,737 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:38,741 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:38,741 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:38,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 14:54:38,742 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:38,746 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:38,747 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:38,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 14:54:38,748 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:38,752 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:38,752 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:38,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 22 treesize of output 16 [2021-06-05 14:54:38,753 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:38,757 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:38,758 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:38,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 14:54:38,759 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:38,763 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:38,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:38,763 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:39,010 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2021-06-05 14:54:39,010 INFO L628 ElimStorePlain]: treesize reduction 350, result has 49.1 percent of original size [2021-06-05 14:54:39,014 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:39,014 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:39,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:39,016 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:39,019 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:39,019 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:39,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:39,020 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:39,023 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:39,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:39,024 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:39,213 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2021-06-05 14:54:39,213 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 14:54:39,217 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:39,217 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:39,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 14:54:39,218 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:39,221 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:39,221 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:39,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 15 treesize of output 11 [2021-06-05 14:54:39,222 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:39,225 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:39,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:39,226 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:39,313 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:39,319 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 14:54:39,320 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:847, output treesize:238 [2021-06-05 14:54:39,615 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 67 [2021-06-05 14:54:39,929 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 14:54:39,930 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768988719] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:54:39,930 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:54:39,930 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:54:39,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216002056] [2021-06-05 14:54:39,930 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:54:39,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:54:39,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:54:39,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:54:39,930 INFO L87 Difference]: Start difference. First operand 445 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 14:54:40,405 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2021-06-05 14:54:40,714 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2021-06-05 14:54:41,049 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 126 [2021-06-05 14:54:41,657 WARN L205 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 138 [2021-06-05 14:54:41,870 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2021-06-05 14:54:42,114 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2021-06-05 14:54:42,297 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2021-06-05 14:54:42,596 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2021-06-05 14:54:42,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:54:42,628 INFO L93 Difference]: Finished difference Result 633 states and 1852 transitions. [2021-06-05 14:54:42,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:54:42,628 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 14:54:42,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:54:42,629 INFO L225 Difference]: With dead ends: 633 [2021-06-05 14:54:42,629 INFO L226 Difference]: Without dead ends: 579 [2021-06-05 14:54:42,629 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 3139.0ms TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2021-06-05 14:54:42,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2021-06-05 14:54:42,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 451. [2021-06-05 14:54:42,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 3.077777777777778) internal successors, (1385), 450 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:54:42,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 1385 transitions. [2021-06-05 14:54:42,633 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 1385 transitions. Word has length 20 [2021-06-05 14:54:42,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:54:42,634 INFO L482 AbstractCegarLoop]: Abstraction has 451 states and 1385 transitions. [2021-06-05 14:54:42,634 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 14:54:42,634 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 1385 transitions. [2021-06-05 14:54:42,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:54:42,634 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:54:42,634 INFO L521 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 14:54:42,834 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7501,265 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:54:42,834 INFO L430 AbstractCegarLoop]: === Iteration 456 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:54:42,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:54:42,835 INFO L82 PathProgramCache]: Analyzing trace with hash -638777248, now seen corresponding path program 64 times [2021-06-05 14:54:42,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:54:42,835 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985975490] [2021-06-05 14:54:42,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:54:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:54:43,095 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 14:54:43,095 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:54:43,095 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985975490] [2021-06-05 14:54:43,095 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985975490] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:54:43,095 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953586330] [2021-06-05 14:54:43,095 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 14:54:43,120 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:54:43,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:54:43,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:54:43,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:54:43,476 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:43,476 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:43,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 22 treesize of output 16 [2021-06-05 14:54:43,477 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:43,481 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:43,481 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:43,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:43,482 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:43,487 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:43,487 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:43,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:43,488 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:43,492 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:43,492 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:43,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:43,493 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:43,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:43,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:43,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 29 treesize of output 21 [2021-06-05 14:54:43,499 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:43,502 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:43,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 22 treesize of output 16 [2021-06-05 14:54:43,503 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:43,751 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2021-06-05 14:54:43,751 INFO L628 ElimStorePlain]: treesize reduction 362, result has 47.2 percent of original size [2021-06-05 14:54:43,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:43,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:43,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 14:54:43,756 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:43,760 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:43,760 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:43,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 15 treesize of output 11 [2021-06-05 14:54:43,761 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:43,764 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:43,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 14:54:43,765 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:43,865 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-06-05 14:54:43,866 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:43,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:43,872 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:43,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:43,874 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:43,877 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:43,878 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:43,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:43,879 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:43,882 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:43,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:43,883 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:44,055 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2021-06-05 14:54:44,055 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 14:54:44,061 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 14:54:44,061 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:847, output treesize:239 [2021-06-05 14:54:44,517 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2021-06-05 14:54:44,666 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 14:54:44,666 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953586330] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:54:44,666 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:54:44,666 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:54:44,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275293153] [2021-06-05 14:54:44,666 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:54:44,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:54:44,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:54:44,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:54:44,666 INFO L87 Difference]: Start difference. First operand 451 states and 1385 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 14:54:45,290 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 64 [2021-06-05 14:54:45,620 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 120 [2021-06-05 14:54:45,885 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2021-06-05 14:54:46,255 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2021-06-05 14:54:46,726 WARN L205 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 85 [2021-06-05 14:54:46,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:54:46,739 INFO L93 Difference]: Finished difference Result 617 states and 1809 transitions. [2021-06-05 14:54:46,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:54:46,740 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 14:54:46,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:54:46,741 INFO L225 Difference]: With dead ends: 617 [2021-06-05 14:54:46,741 INFO L226 Difference]: Without dead ends: 596 [2021-06-05 14:54:46,741 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2538.0ms TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:54:46,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-06-05 14:54:46,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 457. [2021-06-05 14:54:46,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 3.0723684210526314) internal successors, (1401), 456 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:54:46,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 1401 transitions. [2021-06-05 14:54:46,746 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 1401 transitions. Word has length 20 [2021-06-05 14:54:46,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:54:46,746 INFO L482 AbstractCegarLoop]: Abstraction has 457 states and 1401 transitions. [2021-06-05 14:54:46,746 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 14:54:46,746 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 1401 transitions. [2021-06-05 14:54:46,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:54:46,746 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:54:46,746 INFO L521 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 14:54:46,946 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 266 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7588 [2021-06-05 14:54:46,947 INFO L430 AbstractCegarLoop]: === Iteration 457 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:54:46,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:54:46,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1957469660, now seen corresponding path program 65 times [2021-06-05 14:54:46,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:54:46,947 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380602383] [2021-06-05 14:54:46,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:54:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:54:47,314 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 14:54:47,314 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:54:47,314 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380602383] [2021-06-05 14:54:47,314 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380602383] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:54:47,314 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829133769] [2021-06-05 14:54:47,314 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 14:54:47,344 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:54:47,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:54:47,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:54:47,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:54:47,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 31 treesize of output 23 [2021-06-05 14:54:47,559 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,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 30 treesize of output 22 [2021-06-05 14:54:47,563 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,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 30 treesize of output 22 [2021-06-05 14:54:47,576 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:47,580 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:47,584 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:47,588 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:47,592 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:47,596 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,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 14:54:47,599 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,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 22 treesize of output 16 [2021-06-05 14:54:47,603 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,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 22 treesize of output 16 [2021-06-05 14:54:47,607 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,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 37 treesize of output 27 [2021-06-05 14:54:47,611 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:47,615 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:47,619 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:47,623 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:47,627 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,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 14:54:47,630 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,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 37 treesize of output 27 [2021-06-05 14:54:47,634 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,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 14:54:47,638 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,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 14:54:47,642 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,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 38 treesize of output 28 [2021-06-05 14:54:47,646 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,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 38 treesize of output 28 [2021-06-05 14:54:47,650 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,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 23 treesize of output 17 [2021-06-05 14:54:47,653 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,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 23 treesize of output 17 [2021-06-05 14:54:47,657 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:47,820 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-06-05 14:54:47,820 INFO L628 ElimStorePlain]: treesize reduction 168, result has 61.2 percent of original size [2021-06-05 14:54:47,822 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 12 xjuncts. [2021-06-05 14:54:47,822 INFO L247 ElimStorePlain]: Needed 25 recursive calls to eliminate 1 variables, input treesize:1009, output treesize:265 [2021-06-05 14:54:48,389 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 14:54:48,389 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829133769] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:54:48,389 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:54:48,389 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:54:48,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153074148] [2021-06-05 14:54:48,389 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:54:48,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:54:48,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:54:48,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:54:48,390 INFO L87 Difference]: Start difference. First operand 457 states and 1401 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 14:54:48,782 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2021-06-05 14:54:48,995 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2021-06-05 14:54:49,325 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2021-06-05 14:54:49,501 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 67 [2021-06-05 14:54:49,798 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2021-06-05 14:54:50,055 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2021-06-05 14:54:50,454 WARN L205 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2021-06-05 14:54:50,933 WARN L205 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 96 [2021-06-05 14:54:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:54:50,953 INFO L93 Difference]: Finished difference Result 625 states and 1837 transitions. [2021-06-05 14:54:50,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:54:50,953 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 14:54:50,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:54:50,954 INFO L225 Difference]: With dead ends: 625 [2021-06-05 14:54:50,954 INFO L226 Difference]: Without dead ends: 563 [2021-06-05 14:54:50,954 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 3060.1ms TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2021-06-05 14:54:50,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-06-05 14:54:50,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 448. [2021-06-05 14:54:50,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 3.0738255033557045) internal successors, (1374), 447 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:54:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1374 transitions. [2021-06-05 14:54:50,958 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1374 transitions. Word has length 20 [2021-06-05 14:54:50,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:54:50,959 INFO L482 AbstractCegarLoop]: Abstraction has 448 states and 1374 transitions. [2021-06-05 14:54:50,959 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 14:54:50,959 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1374 transitions. [2021-06-05 14:54:50,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:54:50,959 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:54:50,959 INFO L521 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 14:54:51,159 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7667,267 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:54:51,159 INFO L430 AbstractCegarLoop]: === Iteration 458 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:54:51,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:54:51,160 INFO L82 PathProgramCache]: Analyzing trace with hash 266313232, now seen corresponding path program 66 times [2021-06-05 14:54:51,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:54:51,160 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265289589] [2021-06-05 14:54:51,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:54:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:54:51,460 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 14:54:51,460 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:54:51,460 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265289589] [2021-06-05 14:54:51,460 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265289589] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:54:51,460 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791339518] [2021-06-05 14:54:51,460 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 14:54:51,485 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:54:51,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:54:51,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:54:51,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:54:51,849 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:51,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:51,850 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:52,101 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2021-06-05 14:54:52,102 INFO L628 ElimStorePlain]: treesize reduction 165, result has 66.9 percent of original size [2021-06-05 14:54:52,106 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:52,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:52,107 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:52,213 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 14:54:52,214 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:52,218 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:52,218 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:52,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 23 treesize of output 17 [2021-06-05 14:54:52,219 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:52,223 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:52,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:52,224 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:52,326 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 14:54:52,326 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:52,330 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:52,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:52,331 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:52,434 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 14:54:52,434 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:52,438 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:52,438 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:52,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 14:54:52,440 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:52,443 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:52,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 31 treesize of output 23 [2021-06-05 14:54:52,444 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:52,546 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-06-05 14:54:52,547 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:52,550 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:52,551 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:52,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 15 treesize of output 11 [2021-06-05 14:54:52,552 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:52,555 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:52,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:52,556 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:52,636 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:52,642 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 14:54:52,642 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:505, output treesize:223 [2021-06-05 14:54:52,811 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2021-06-05 14:54:53,200 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 14:54:53,200 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791339518] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:54:53,200 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:54:53,201 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:54:53,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176742942] [2021-06-05 14:54:53,201 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:54:53,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:54:53,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:54:53,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:54:53,201 INFO L87 Difference]: Start difference. First operand 448 states and 1374 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 14:54:53,833 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2021-06-05 14:54:54,131 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 117 [2021-06-05 14:54:54,337 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2021-06-05 14:54:54,595 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 75 [2021-06-05 14:54:54,915 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 84 [2021-06-05 14:54:54,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:54:54,927 INFO L93 Difference]: Finished difference Result 621 states and 1813 transitions. [2021-06-05 14:54:54,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:54:54,927 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 14:54:54,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:54:54,928 INFO L225 Difference]: With dead ends: 621 [2021-06-05 14:54:54,928 INFO L226 Difference]: Without dead ends: 600 [2021-06-05 14:54:54,928 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2215.8ms TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:54:54,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2021-06-05 14:54:54,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 454. [2021-06-05 14:54:54,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 3.068432671081678) internal successors, (1390), 453 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:54:54,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1390 transitions. [2021-06-05 14:54:54,933 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1390 transitions. Word has length 20 [2021-06-05 14:54:54,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:54:54,933 INFO L482 AbstractCegarLoop]: Abstraction has 454 states and 1390 transitions. [2021-06-05 14:54:54,933 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 14:54:54,933 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1390 transitions. [2021-06-05 14:54:54,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:54:54,934 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:54:54,934 INFO L521 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 14:54:55,134 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 268 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7715 [2021-06-05 14:54:55,134 INFO L430 AbstractCegarLoop]: === Iteration 459 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:54:55,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:54:55,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1432407156, now seen corresponding path program 67 times [2021-06-05 14:54:55,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:54:55,135 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392803124] [2021-06-05 14:54:55,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:54:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:54:55,412 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 14:54:55,412 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:54:55,412 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392803124] [2021-06-05 14:54:55,412 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392803124] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:54:55,412 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381477775] [2021-06-05 14:54:55,412 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 14:54:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:54:55,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 14:54:55,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:54:56,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:56,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:56,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 14:54:56,080 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:56,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:56,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:56,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 29 treesize of output 21 [2021-06-05 14:54:56,087 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:56,093 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:56,093 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:56,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:56,094 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:56,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:56,101 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:56,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:54:56,102 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:56,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:56,108 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:56,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 22 treesize of output 16 [2021-06-05 14:54:56,109 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:56,114 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:56,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 30 treesize of output 22 [2021-06-05 14:54:56,115 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:56,448 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2021-06-05 14:54:56,449 INFO L628 ElimStorePlain]: treesize reduction 442, result has 47.4 percent of original size [2021-06-05 14:54:56,453 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:56,453 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:56,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 31 treesize of output 23 [2021-06-05 14:54:56,454 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:56,458 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:56,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:56,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 30 treesize of output 22 [2021-06-05 14:54:56,460 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:56,463 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:56,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 23 treesize of output 17 [2021-06-05 14:54:56,464 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:56,722 WARN L205 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2021-06-05 14:54:56,722 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.7 percent of original size [2021-06-05 14:54:56,726 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:56,726 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:56,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 14:54:56,727 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:56,731 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:56,731 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:56,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 15 treesize of output 11 [2021-06-05 14:54:56,732 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:56,735 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:54:56,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 23 treesize of output 17 [2021-06-05 14:54:56,736 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:56,967 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2021-06-05 14:54:56,967 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.7 percent of original size [2021-06-05 14:54:56,973 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 14:54:56,973 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:955, output treesize:285 [2021-06-05 14:54:57,806 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1381, v_prenex_1361, v_prenex_1371, v_prenex_1363, get_6, v_prenex_1373, v_prenex_1365, v_prenex_1353, v_prenex_1375, v_prenex_1367, v_prenex_1355, v_prenex_1369, v_prenex_1357, v_prenex_1359], 1=[get_3, v_prenex_1370, v_prenex_1380, v_prenex_1372, v_prenex_1360, v_prenex_1352, v_prenex_1374, v_prenex_1362, v_prenex_1354, v_prenex_1364, v_prenex_1356, v_prenex_1366, v_prenex_1358, v_prenex_1368]} [2021-06-05 14:54:57,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 15 treesize of output 11 [2021-06-05 14:54:57,818 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:58,305 WARN L205 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 110 [2021-06-05 14:54:58,306 INFO L628 ElimStorePlain]: treesize reduction 1145, result has 26.0 percent of original size [2021-06-05 14:54:58,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:58,312 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:58,459 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-05 14:54:58,459 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:58,459 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1371 vanished before elimination [2021-06-05 14:54:58,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:58,465 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:58,605 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-06-05 14:54:58,605 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:58,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:58,611 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:58,749 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-06-05 14:54:58,750 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:58,750 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1373 vanished before elimination [2021-06-05 14:54:58,750 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1365 vanished before elimination [2021-06-05 14:54:58,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 14:54:58,755 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:58,895 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-06-05 14:54:58,895 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:58,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 7 treesize of output 5 [2021-06-05 14:54:58,900 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:59,032 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-06-05 14:54:59,033 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:59,033 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1367 vanished before elimination [2021-06-05 14:54:59,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:59,037 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:59,168 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-06-05 14:54:59,168 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:59,168 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1369 vanished before elimination [2021-06-05 14:54:59,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:54:59,173 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:54:59,301 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-06-05 14:54:59,301 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:54:59,301 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1359 vanished before elimination [2021-06-05 14:54:59,301 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 14:54:59,301 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1370 vanished before elimination [2021-06-05 14:54:59,301 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1380 vanished before elimination [2021-06-05 14:54:59,301 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1372 vanished before elimination [2021-06-05 14:54:59,301 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1360 vanished before elimination [2021-06-05 14:54:59,301 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1352 vanished before elimination [2021-06-05 14:54:59,301 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1374 vanished before elimination [2021-06-05 14:54:59,302 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1362 vanished before elimination [2021-06-05 14:54:59,302 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1354 vanished before elimination [2021-06-05 14:54:59,302 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1364 vanished before elimination [2021-06-05 14:54:59,302 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1356 vanished before elimination [2021-06-05 14:54:59,302 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1366 vanished before elimination [2021-06-05 14:54:59,302 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1358 vanished before elimination [2021-06-05 14:54:59,302 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1368 vanished before elimination [2021-06-05 14:54:59,306 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 14:54:59,306 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 42 variables, input treesize:1555, output treesize:292 [2021-06-05 14:54:59,435 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-06-05 14:54:59,629 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2021-06-05 14:54:59,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 14:54:59,754 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381477775] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:54:59,754 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:54:59,754 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:54:59,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018653951] [2021-06-05 14:54:59,754 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:54:59,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:54:59,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:54:59,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:54:59,754 INFO L87 Difference]: Start difference. First operand 454 states and 1390 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 14:55:00,206 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2021-06-05 14:55:00,540 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2021-06-05 14:55:00,913 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 123 [2021-06-05 14:55:01,238 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2021-06-05 14:55:01,685 WARN L205 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 82 [2021-06-05 14:55:02,127 WARN L205 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 94 [2021-06-05 14:55:02,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:55:02,159 INFO L93 Difference]: Finished difference Result 622 states and 1819 transitions. [2021-06-05 14:55:02,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:55:02,160 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 14:55:02,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:55:02,160 INFO L225 Difference]: With dead ends: 622 [2021-06-05 14:55:02,161 INFO L226 Difference]: Without dead ends: 607 [2021-06-05 14:55:02,161 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 3003.3ms TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:55:02,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2021-06-05 14:55:02,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 451. [2021-06-05 14:55:02,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 3.071111111111111) internal successors, (1382), 450 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:55:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 1382 transitions. [2021-06-05 14:55:02,166 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 1382 transitions. Word has length 20 [2021-06-05 14:55:02,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:55:02,166 INFO L482 AbstractCegarLoop]: Abstraction has 451 states and 1382 transitions. [2021-06-05 14:55:02,166 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 14:55:02,166 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 1382 transitions. [2021-06-05 14:55:02,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:55:02,166 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:55:02,166 INFO L521 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 14:55:02,367 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 269 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7809 [2021-06-05 14:55:02,367 INFO L430 AbstractCegarLoop]: === Iteration 460 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:55:02,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:55:02,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1605654848, now seen corresponding path program 68 times [2021-06-05 14:55:02,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:55:02,367 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521979013] [2021-06-05 14:55:02,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:55:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:55:02,617 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 14:55:02,617 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:55:02,617 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521979013] [2021-06-05 14:55:02,617 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521979013] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:55:02,617 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388647345] [2021-06-05 14:55:02,617 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 14:55:02,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:55:02,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:55:02,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 14:55:02,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:55:03,074 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 67 [2021-06-05 14:55:03,553 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:03,554 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:03,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 23 treesize of output 17 [2021-06-05 14:55:03,555 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:03,561 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:03,562 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:03,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 30 treesize of output 22 [2021-06-05 14:55:03,563 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:03,569 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:03,569 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:03,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 23 treesize of output 17 [2021-06-05 14:55:03,571 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:03,577 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:03,577 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:03,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 29 treesize of output 21 [2021-06-05 14:55:03,579 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:03,585 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:03,585 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:03,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:03,586 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:03,592 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:03,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 22 treesize of output 16 [2021-06-05 14:55:03,593 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:04,130 WARN L205 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 93 [2021-06-05 14:55:04,131 INFO L628 ElimStorePlain]: treesize reduction 599, result has 48.0 percent of original size [2021-06-05 14:55:04,136 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:04,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:04,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 14:55:04,138 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:04,143 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:04,143 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:04,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 14:55:04,144 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:04,149 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:04,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:04,150 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:04,368 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-06-05 14:55:04,368 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:04,373 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:04,374 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:04,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 23 treesize of output 17 [2021-06-05 14:55:04,375 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:04,380 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:04,380 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:04,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:04,381 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:04,386 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:04,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:04,387 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:04,597 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-06-05 14:55:04,597 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:04,603 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:04,604 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:04,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:04,605 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:04,610 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:04,611 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:04,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 14:55:04,612 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:04,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:04,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 31 treesize of output 23 [2021-06-05 14:55:04,619 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:05,014 WARN L205 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 77 [2021-06-05 14:55:05,014 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.8 percent of original size [2021-06-05 14:55:05,032 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 14:55:05,032 INFO L247 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:1321, output treesize:432 [2021-06-05 14:55:05,242 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2021-06-05 14:55:05,576 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 116 [2021-06-05 14:55:05,902 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1406, v_prenex_1416, v_prenex_1408, get_6, v_prenex_1410, v_prenex_1412, v_prenex_1404, v_prenex_1414], 1=[get_3, v_prenex_1405, v_prenex_1407, v_prenex_1409, v_prenex_1411, v_prenex_1413, v_prenex_1415, v_prenex_1403]} [2021-06-05 14:55:05,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 38 treesize of output 28 [2021-06-05 14:55:05,913 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:05,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 30 treesize of output 22 [2021-06-05 14:55:05,924 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:05,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 30 treesize of output 22 [2021-06-05 14:55:05,935 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:05,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 31 treesize of output 23 [2021-06-05 14:55:05,946 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:05,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 14:55:05,957 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:05,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 37 treesize of output 27 [2021-06-05 14:55:05,968 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:06,646 WARN L205 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 122 [2021-06-05 14:55:06,646 INFO L628 ElimStorePlain]: treesize reduction 2068, result has 16.0 percent of original size [2021-06-05 14:55:06,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 7 treesize of output 5 [2021-06-05 14:55:06,656 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:06,794 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-06-05 14:55:06,794 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:06,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:06,805 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:06,944 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-06-05 14:55:06,944 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:06,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 16 treesize of output 12 [2021-06-05 14:55:06,951 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:07,085 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-06-05 14:55:07,085 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:07,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:07,092 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:07,219 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-06-05 14:55:07,219 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:07,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:07,225 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:07,351 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-06-05 14:55:07,351 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:07,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 7 treesize of output 5 [2021-06-05 14:55:07,356 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:07,484 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-06-05 14:55:07,484 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:07,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:07,489 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:07,608 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 14:55:07,609 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:07,609 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 14:55:07,609 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1405 vanished before elimination [2021-06-05 14:55:07,609 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1407 vanished before elimination [2021-06-05 14:55:07,609 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1409 vanished before elimination [2021-06-05 14:55:07,609 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1411 vanished before elimination [2021-06-05 14:55:07,609 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1413 vanished before elimination [2021-06-05 14:55:07,609 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1415 vanished before elimination [2021-06-05 14:55:07,609 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1403 vanished before elimination [2021-06-05 14:55:07,613 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 16 dim-1 vars, End of recursive call: and 14 xjuncts. [2021-06-05 14:55:07,613 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 24 variables, input treesize:2665, output treesize:272 [2021-06-05 14:55:07,816 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2021-06-05 14:55:07,940 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 14:55:07,941 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388647345] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:55:07,941 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:55:07,941 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:55:07,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928316579] [2021-06-05 14:55:07,941 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:55:07,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:55:07,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:55:07,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:55:07,941 INFO L87 Difference]: Start difference. First operand 451 states and 1382 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 14:55:08,259 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2021-06-05 14:55:08,688 WARN L205 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 159 [2021-06-05 14:55:09,341 WARN L205 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 176 [2021-06-05 14:55:09,580 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2021-06-05 14:55:09,869 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2021-06-05 14:55:09,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:55:09,884 INFO L93 Difference]: Finished difference Result 595 states and 1763 transitions. [2021-06-05 14:55:09,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:55:09,885 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 14:55:09,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:55:09,886 INFO L225 Difference]: With dead ends: 595 [2021-06-05 14:55:09,886 INFO L226 Difference]: Without dead ends: 580 [2021-06-05 14:55:09,886 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 3015.3ms TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:55:09,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-06-05 14:55:09,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 448. [2021-06-05 14:55:09,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 3.0738255033557045) internal successors, (1374), 447 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:55:09,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1374 transitions. [2021-06-05 14:55:09,890 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1374 transitions. Word has length 20 [2021-06-05 14:55:09,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:55:09,890 INFO L482 AbstractCegarLoop]: Abstraction has 448 states and 1374 transitions. [2021-06-05 14:55:09,890 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 14:55:09,891 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1374 transitions. [2021-06-05 14:55:09,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:55:09,891 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:55:09,891 INFO L521 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 14:55:10,091 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8100,270 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:55:10,092 INFO L430 AbstractCegarLoop]: === Iteration 461 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:55:10,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:55:10,092 INFO L82 PathProgramCache]: Analyzing trace with hash -917231582, now seen corresponding path program 69 times [2021-06-05 14:55:10,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:55:10,092 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252774212] [2021-06-05 14:55:10,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:55:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:55:10,496 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2021-06-05 14:55:10,606 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 14:55:10,606 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:55:10,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252774212] [2021-06-05 14:55:10,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252774212] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:55:10,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208838303] [2021-06-05 14:55:10,607 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 14:55:10,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:55:10,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:55:10,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:55:10,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:55:10,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 14:55:10,773 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 36 treesize of output 26 [2021-06-05 14:55:10,778 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 29 treesize of output 21 [2021-06-05 14:55:10,782 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 36 treesize of output 26 [2021-06-05 14:55:10,786 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 38 treesize of output 28 [2021-06-05 14:55:10,790 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:10,795 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:10,799 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 14:55:10,803 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:10,816 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 14:55:10,820 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:10,824 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 45 treesize of output 33 [2021-06-05 14:55:10,830 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 31 treesize of output 23 [2021-06-05 14:55:10,834 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 31 treesize of output 23 [2021-06-05 14:55:10,839 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 31 treesize of output 23 [2021-06-05 14:55:10,843 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 43 treesize of output 31 [2021-06-05 14:55:10,847 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 29 treesize of output 21 [2021-06-05 14:55:10,851 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 37 treesize of output 27 [2021-06-05 14:55:10,855 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 37 treesize of output 27 [2021-06-05 14:55:10,859 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 29 treesize of output 21 [2021-06-05 14:55:10,863 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 44 treesize of output 32 [2021-06-05 14:55:10,867 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 14:55:10,871 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 14:55:10,875 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 14:55:10,879 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 29 treesize of output 21 [2021-06-05 14:55:10,883 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 37 treesize of output 27 [2021-06-05 14:55:10,887 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 38 treesize of output 28 [2021-06-05 14:55:10,891 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 31 treesize of output 23 [2021-06-05 14:55:10,895 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 44 treesize of output 32 [2021-06-05 14:55:10,899 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 37 treesize of output 27 [2021-06-05 14:55:10,902 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 14:55:10,906 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 14:55:10,910 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 30 treesize of output 22 [2021-06-05 14:55:10,914 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 38 treesize of output 28 [2021-06-05 14:55:10,918 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 37 treesize of output 27 [2021-06-05 14:55:10,921 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:10,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 36 treesize of output 26 [2021-06-05 14:55:10,925 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:11,073 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2021-06-05 14:55:11,073 INFO L628 ElimStorePlain]: treesize reduction 313, result has 38.3 percent of original size [2021-06-05 14:55:11,075 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:55:11,075 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1729, output treesize:194 [2021-06-05 14:55:11,527 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 14:55:11,527 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208838303] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:55:11,527 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:55:11,527 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:55:11,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828381588] [2021-06-05 14:55:11,527 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:55:11,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:55:11,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:55:11,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:55:11,528 INFO L87 Difference]: Start difference. First operand 448 states and 1374 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 14:55:12,127 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2021-06-05 14:55:12,350 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2021-06-05 14:55:12,686 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2021-06-05 14:55:13,082 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 83 [2021-06-05 14:55:13,503 WARN L205 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 91 [2021-06-05 14:55:13,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:55:13,516 INFO L93 Difference]: Finished difference Result 673 states and 1944 transitions. [2021-06-05 14:55:13,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:55:13,517 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 14:55:13,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:55:13,517 INFO L225 Difference]: With dead ends: 673 [2021-06-05 14:55:13,517 INFO L226 Difference]: Without dead ends: 652 [2021-06-05 14:55:13,517 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2526.3ms TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:55:13,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2021-06-05 14:55:13,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 452. [2021-06-05 14:55:13,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 3.0864745011086474) internal successors, (1392), 451 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:55:13,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1392 transitions. [2021-06-05 14:55:13,523 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1392 transitions. Word has length 20 [2021-06-05 14:55:13,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:55:13,523 INFO L482 AbstractCegarLoop]: Abstraction has 452 states and 1392 transitions. [2021-06-05 14:55:13,523 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 14:55:13,523 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1392 transitions. [2021-06-05 14:55:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:55:13,523 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:55:13,523 INFO L521 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 14:55:13,724 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 271 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8300 [2021-06-05 14:55:13,724 INFO L430 AbstractCegarLoop]: === Iteration 462 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:55:13,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:55:13,724 INFO L82 PathProgramCache]: Analyzing trace with hash -2135866942, now seen corresponding path program 70 times [2021-06-05 14:55:13,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:55:13,724 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360176053] [2021-06-05 14:55:13,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:55:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:55:14,091 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 14:55:14,091 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:55:14,091 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360176053] [2021-06-05 14:55:14,091 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360176053] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:55:14,091 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184065561] [2021-06-05 14:55:14,091 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 14:55:14,134 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:55:14,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:55:14,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:55:14,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:55:14,426 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:14,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 23 treesize of output 17 [2021-06-05 14:55:14,428 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:14,701 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2021-06-05 14:55:14,701 INFO L628 ElimStorePlain]: treesize reduction 170, result has 67.2 percent of original size [2021-06-05 14:55:14,705 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:14,706 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:14,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:14,707 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:14,710 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:14,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:14,711 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:14,827 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 14:55:14,827 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:14,832 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:14,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:14,833 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:14,942 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 14:55:14,943 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:14,946 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:14,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 14:55:14,947 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:15,055 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-06-05 14:55:15,056 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:15,059 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:15,060 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:15,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:15,061 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:15,064 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:15,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 14:55:15,065 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:15,165 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:15,169 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:15,169 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:15,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:15,170 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:15,173 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:15,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:15,174 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:15,270 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:15,276 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 14:55:15,276 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:525, output treesize:238 [2021-06-05 14:55:15,477 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2021-06-05 14:55:15,787 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2021-06-05 14:55:15,970 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2021-06-05 14:55:16,146 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 14:55:16,147 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184065561] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:55:16,147 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:55:16,147 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:55:16,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041266395] [2021-06-05 14:55:16,147 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:55:16,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:55:16,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:55:16,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:55:16,147 INFO L87 Difference]: Start difference. First operand 452 states and 1392 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 14:55:16,639 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2021-06-05 14:55:17,062 WARN L205 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 127 [2021-06-05 14:55:17,314 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2021-06-05 14:55:17,772 WARN L205 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 79 [2021-06-05 14:55:18,163 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 90 [2021-06-05 14:55:18,724 WARN L205 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 94 [2021-06-05 14:55:19,095 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 99 [2021-06-05 14:55:19,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:55:19,102 INFO L93 Difference]: Finished difference Result 671 states and 1941 transitions. [2021-06-05 14:55:19,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:55:19,102 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 14:55:19,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:55:19,103 INFO L225 Difference]: With dead ends: 671 [2021-06-05 14:55:19,103 INFO L226 Difference]: Without dead ends: 656 [2021-06-05 14:55:19,103 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 3655.8ms TimeCoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:55:19,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2021-06-05 14:55:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 450. [2021-06-05 14:55:19,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 3.084632516703786) internal successors, (1385), 449 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:55:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1385 transitions. [2021-06-05 14:55:19,108 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1385 transitions. Word has length 20 [2021-06-05 14:55:19,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:55:19,109 INFO L482 AbstractCegarLoop]: Abstraction has 450 states and 1385 transitions. [2021-06-05 14:55:19,109 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 14:55:19,109 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1385 transitions. [2021-06-05 14:55:19,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:55:19,109 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:55:19,109 INFO L521 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 14:55:19,309 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8336,272 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:55:19,310 INFO L430 AbstractCegarLoop]: === Iteration 463 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:55:19,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:55:19,310 INFO L82 PathProgramCache]: Analyzing trace with hash 71828966, now seen corresponding path program 71 times [2021-06-05 14:55:19,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:55:19,310 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608599679] [2021-06-05 14:55:19,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:55:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:55:19,680 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 14:55:19,681 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:55:19,681 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608599679] [2021-06-05 14:55:19,681 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608599679] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:55:19,681 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601298303] [2021-06-05 14:55:19,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 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 14:55:19,707 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:55:19,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:55:19,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:55:19,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:55:19,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 37 treesize of output 27 [2021-06-05 14:55:19,859 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 31 treesize of output 23 [2021-06-05 14:55:19,863 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 36 treesize of output 26 [2021-06-05 14:55:19,867 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 14:55:19,872 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 30 treesize of output 22 [2021-06-05 14:55:19,876 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 14:55:19,880 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:55: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 29 treesize of output 21 [2021-06-05 14:55:19,884 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:55: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 31 treesize of output 23 [2021-06-05 14:55:19,888 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:55: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 37 treesize of output 27 [2021-06-05 14:55:19,893 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:55: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 31 treesize of output 23 [2021-06-05 14:55:19,897 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 29 treesize of output 21 [2021-06-05 14:55:19,901 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 45 treesize of output 33 [2021-06-05 14:55:19,905 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:55: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 43 treesize of output 31 [2021-06-05 14:55:19,909 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:55: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 37 treesize of output 27 [2021-06-05 14:55:19,913 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 30 treesize of output 22 [2021-06-05 14:55:19,918 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 37 treesize of output 27 [2021-06-05 14:55:19,922 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 30 treesize of output 22 [2021-06-05 14:55:19,926 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 44 treesize of output 32 [2021-06-05 14:55:19,930 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 30 treesize of output 22 [2021-06-05 14:55:19,934 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:55: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 14:55:19,939 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 14:55:19,943 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 38 treesize of output 28 [2021-06-05 14:55:19,947 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 30 treesize of output 22 [2021-06-05 14:55:19,951 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 44 treesize of output 32 [2021-06-05 14:55:19,955 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 30 treesize of output 22 [2021-06-05 14:55:19,959 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 14:55:19,963 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 14:55:19,967 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:19,972 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 36 treesize of output 26 [2021-06-05 14:55:19,975 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 31 treesize of output 23 [2021-06-05 14:55:19,980 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 30 treesize of output 22 [2021-06-05 14:55:19,984 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 38 treesize of output 28 [2021-06-05 14:55:19,988 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,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 37 treesize of output 27 [2021-06-05 14:55:19,992 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:19,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:19,998 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:20,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:20,003 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:20,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 36 treesize of output 26 [2021-06-05 14:55:20,007 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:20,156 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2021-06-05 14:55:20,157 INFO L628 ElimStorePlain]: treesize reduction 323, result has 37.5 percent of original size [2021-06-05 14:55:20,158 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:55:20,158 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1729, output treesize:194 [2021-06-05 14:55:20,666 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 14:55:20,666 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601298303] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:55:20,666 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:55:20,666 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:55:20,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013639689] [2021-06-05 14:55:20,666 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:55:20,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:55:20,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:55:20,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:55:20,667 INFO L87 Difference]: Start difference. First operand 450 states and 1385 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 14:55:21,382 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2021-06-05 14:55:21,570 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2021-06-05 14:55:21,987 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 71 [2021-06-05 14:55:22,419 WARN L205 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 76 [2021-06-05 14:55:22,937 WARN L205 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 85 [2021-06-05 14:55:22,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:55:22,950 INFO L93 Difference]: Finished difference Result 704 states and 2012 transitions. [2021-06-05 14:55:22,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:55:22,950 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 14:55:22,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:55:22,951 INFO L225 Difference]: With dead ends: 704 [2021-06-05 14:55:22,951 INFO L226 Difference]: Without dead ends: 683 [2021-06-05 14:55:22,951 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2721.3ms TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:55:22,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2021-06-05 14:55:22,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 453. [2021-06-05 14:55:22,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 3.088495575221239) internal successors, (1396), 452 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:55:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 1396 transitions. [2021-06-05 14:55:22,956 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 1396 transitions. Word has length 20 [2021-06-05 14:55:22,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:55:22,957 INFO L482 AbstractCegarLoop]: Abstraction has 453 states and 1396 transitions. [2021-06-05 14:55:22,957 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 14:55:22,957 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 1396 transitions. [2021-06-05 14:55:22,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:55:22,957 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:55:22,957 INFO L521 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 14:55:23,158 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 273 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8407 [2021-06-05 14:55:23,158 INFO L430 AbstractCegarLoop]: === Iteration 464 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:55:23,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:55:23,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1098360030, now seen corresponding path program 72 times [2021-06-05 14:55:23,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:55:23,158 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985319906] [2021-06-05 14:55:23,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:55:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:55:23,451 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 14:55:23,451 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:55:23,451 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985319906] [2021-06-05 14:55:23,451 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985319906] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:55:23,451 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721394635] [2021-06-05 14:55:23,451 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 14:55:23,477 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:55:23,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:55:23,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 14:55:23,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:55:24,026 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:24,027 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:24,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:24,028 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:24,033 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:24,033 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:24,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 23 treesize of output 17 [2021-06-05 14:55:24,034 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:24,039 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:24,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 30 treesize of output 22 [2021-06-05 14:55:24,040 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:24,405 WARN L205 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 116 [2021-06-05 14:55:24,406 INFO L628 ElimStorePlain]: treesize reduction 188, result has 70.1 percent of original size [2021-06-05 14:55:24,410 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:24,411 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:24,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 15 treesize of output 11 [2021-06-05 14:55:24,412 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:24,417 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:24,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:24,418 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:24,584 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-06-05 14:55:24,584 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:24,590 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:24,590 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:24,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 31 treesize of output 23 [2021-06-05 14:55:24,598 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:24,604 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:24,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:24,605 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:24,763 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-06-05 14:55:24,764 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:24,768 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55: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 15 treesize of output 11 [2021-06-05 14:55:24,769 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:24,920 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-06-05 14:55:24,920 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:24,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:24,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 14:55:24,925 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:25,078 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-06-05 14:55:25,079 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:25,083 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:25,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 15 treesize of output 11 [2021-06-05 14:55:25,084 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:25,232 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 14:55:25,232 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:25,240 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 14:55:25,240 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:657, output treesize:343 [2021-06-05 14:55:25,493 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 113 [2021-06-05 14:55:25,709 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1471, v_prenex_1473, get_6, v_prenex_1461, v_prenex_1483, v_prenex_1475, v_prenex_1463, v_prenex_1477, v_prenex_1465, v_prenex_1457, v_prenex_1479, v_prenex_1467, v_prenex_1459, v_prenex_1469], 1=[get_3, v_prenex_1460, v_prenex_1482, v_prenex_1470, v_prenex_1462, v_prenex_1472, v_prenex_1464, v_prenex_1474, v_prenex_1466, v_prenex_1476, v_prenex_1468, v_prenex_1456, v_prenex_1478, v_prenex_1458]} [2021-06-05 14:55:25,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 15 treesize of output 11 [2021-06-05 14:55:25,720 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:26,275 WARN L205 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 280 DAG size of output: 125 [2021-06-05 14:55:26,276 INFO L628 ElimStorePlain]: treesize reduction 1196, result has 26.3 percent of original size [2021-06-05 14:55:26,276 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1473 vanished before elimination [2021-06-05 14:55:26,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 16 treesize of output 12 [2021-06-05 14:55:26,282 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:26,478 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-06-05 14:55:26,478 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:26,478 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1461 vanished before elimination [2021-06-05 14:55:26,478 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1483 vanished before elimination [2021-06-05 14:55:26,478 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1475 vanished before elimination [2021-06-05 14:55:26,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 14:55:26,484 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:26,659 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-06-05 14:55:26,659 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:26,659 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1477 vanished before elimination [2021-06-05 14:55:26,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 14:55:26,665 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:26,836 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-06-05 14:55:26,837 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:26,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 16 treesize of output 12 [2021-06-05 14:55:26,843 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:26,995 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-05 14:55:26,995 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:26,995 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1479 vanished before elimination [2021-06-05 14:55:27,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 16 treesize of output 12 [2021-06-05 14:55:27,005 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:27,173 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-06-05 14:55:27,174 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:27,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:27,179 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:27,323 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-06-05 14:55:27,324 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:27,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:27,339 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:27,481 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 14:55:27,481 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:27,481 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 14:55:27,481 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1460 vanished before elimination [2021-06-05 14:55:27,481 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1482 vanished before elimination [2021-06-05 14:55:27,481 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1470 vanished before elimination [2021-06-05 14:55:27,481 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1462 vanished before elimination [2021-06-05 14:55:27,481 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1472 vanished before elimination [2021-06-05 14:55:27,481 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1464 vanished before elimination [2021-06-05 14:55:27,482 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1474 vanished before elimination [2021-06-05 14:55:27,482 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1466 vanished before elimination [2021-06-05 14:55:27,482 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1476 vanished before elimination [2021-06-05 14:55:27,482 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1468 vanished before elimination [2021-06-05 14:55:27,482 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1456 vanished before elimination [2021-06-05 14:55:27,482 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1478 vanished before elimination [2021-06-05 14:55:27,482 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1458 vanished before elimination [2021-06-05 14:55:27,486 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 14:55:27,486 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 42 variables, input treesize:1629, output treesize:328 [2021-06-05 14:55:27,735 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2021-06-05 14:55:28,254 WARN L205 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2021-06-05 14:55:28,490 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2021-06-05 14:55:28,606 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 14:55:28,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721394635] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:55:28,606 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:55:28,606 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:55:28,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622349735] [2021-06-05 14:55:28,607 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:55:28,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:55:28,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:55:28,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:55:28,607 INFO L87 Difference]: Start difference. First operand 453 states and 1396 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 14:55:29,067 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-06-05 14:55:29,361 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2021-06-05 14:55:29,815 WARN L205 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2021-06-05 14:55:30,436 WARN L205 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2021-06-05 14:55:31,136 WARN L205 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 83 [2021-06-05 14:55:31,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:55:31,157 INFO L93 Difference]: Finished difference Result 688 states and 1992 transitions. [2021-06-05 14:55:31,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:55:31,157 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 14:55:31,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:55:31,158 INFO L225 Difference]: With dead ends: 688 [2021-06-05 14:55:31,158 INFO L226 Difference]: Without dead ends: 673 [2021-06-05 14:55:31,158 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 3892.2ms TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:55:31,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2021-06-05 14:55:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 450. [2021-06-05 14:55:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 3.084632516703786) internal successors, (1385), 449 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:55:31,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1385 transitions. [2021-06-05 14:55:31,163 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1385 transitions. Word has length 20 [2021-06-05 14:55:31,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:55:31,163 INFO L482 AbstractCegarLoop]: Abstraction has 450 states and 1385 transitions. [2021-06-05 14:55:31,163 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 14:55:31,163 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1385 transitions. [2021-06-05 14:55:31,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:55:31,164 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:55:31,164 INFO L521 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 14:55:31,364 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8441,274 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:55:31,364 INFO L430 AbstractCegarLoop]: === Iteration 465 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:55:31,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:55:31,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1115297082, now seen corresponding path program 73 times [2021-06-05 14:55:31,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:55:31,365 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008689224] [2021-06-05 14:55:31,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:55:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:55:31,634 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 14:55:31,634 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:55:31,634 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008689224] [2021-06-05 14:55:31,634 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008689224] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:55:31,634 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705155752] [2021-06-05 14:55:31,634 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 14:55:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:55:31,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:55:31,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:55:31,975 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:31,975 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:31,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:31,976 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:31,980 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:31,980 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:31,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 30 treesize of output 22 [2021-06-05 14:55:31,981 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:31,985 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:31,985 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:31,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 22 treesize of output 16 [2021-06-05 14:55:31,986 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:31,990 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:31,990 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:31,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 22 treesize of output 16 [2021-06-05 14:55:31,991 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:31,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:31,995 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:31,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 23 treesize of output 17 [2021-06-05 14:55:31,996 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:31,999 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:31,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:32,000 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:32,270 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2021-06-05 14:55:32,271 INFO L628 ElimStorePlain]: treesize reduction 349, result has 48.9 percent of original size [2021-06-05 14:55:32,274 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:32,274 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:32,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:32,275 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:32,278 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:32,279 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:32,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:32,280 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:32,283 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:32,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:32,288 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:32,398 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-06-05 14:55:32,398 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:32,402 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:32,402 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:32,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 30 treesize of output 22 [2021-06-05 14:55:32,403 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:32,407 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:32,407 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:32,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:32,408 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:32,411 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:32,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 31 treesize of output 23 [2021-06-05 14:55:32,412 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:32,590 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2021-06-05 14:55:32,591 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 14:55:32,597 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 14:55:32,597 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:841, output treesize:235 [2021-06-05 14:55:33,028 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2021-06-05 14:55:33,252 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2021-06-05 14:55:33,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 14:55:33,414 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705155752] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:55:33,414 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:55:33,414 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:55:33,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984035541] [2021-06-05 14:55:33,415 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:55:33,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:55:33,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:55:33,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:55:33,415 INFO L87 Difference]: Start difference. First operand 450 states and 1385 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 14:55:33,852 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2021-06-05 14:55:34,213 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 117 [2021-06-05 14:55:34,515 WARN L205 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2021-06-05 14:55:34,968 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2021-06-05 14:55:35,394 WARN L205 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 78 [2021-06-05 14:55:35,964 WARN L205 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 89 [2021-06-05 14:55:36,383 WARN L205 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 87 [2021-06-05 14:55:36,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:55:36,390 INFO L93 Difference]: Finished difference Result 711 states and 2032 transitions. [2021-06-05 14:55:36,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:55:36,391 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 14:55:36,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:55:36,392 INFO L225 Difference]: With dead ends: 711 [2021-06-05 14:55:36,392 INFO L226 Difference]: Without dead ends: 696 [2021-06-05 14:55:36,392 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 3533.2ms TimeCoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:55:36,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2021-06-05 14:55:36,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 452. [2021-06-05 14:55:36,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 3.090909090909091) internal successors, (1394), 451 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 14:55:36,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1394 transitions. [2021-06-05 14:55:36,397 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1394 transitions. Word has length 20 [2021-06-05 14:55:36,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:55:36,397 INFO L482 AbstractCegarLoop]: Abstraction has 452 states and 1394 transitions. [2021-06-05 14:55:36,397 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 14:55:36,397 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1394 transitions. [2021-06-05 14:55:36,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:55:36,398 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:55:36,398 INFO L521 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 14:55:36,598 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8572,275 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:55:36,598 INFO L430 AbstractCegarLoop]: === Iteration 466 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:55:36,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:55:36,598 INFO L82 PathProgramCache]: Analyzing trace with hash 24986754, now seen corresponding path program 74 times [2021-06-05 14:55:36,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:55:36,599 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869674524] [2021-06-05 14:55:36,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:55:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:55: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 14:55:36,941 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:55:36,941 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869674524] [2021-06-05 14:55:36,941 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869674524] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:55:36,941 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211641108] [2021-06-05 14:55:36,941 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 14:55:36,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:55:36,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:55:36,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:55:36,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:55:37,469 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:37,469 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:37,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:37,470 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:37,475 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:37,475 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:37,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:37,476 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:37,480 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:37,481 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:37,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 14:55:37,482 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:37,486 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:37,487 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:37,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:37,488 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:37,493 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:37,493 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:37,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:37,494 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:37,499 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:37,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 30 treesize of output 22 [2021-06-05 14:55:37,500 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:37,814 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2021-06-05 14:55:37,814 INFO L628 ElimStorePlain]: treesize reduction 378, result has 49.1 percent of original size [2021-06-05 14:55:37,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:37,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:37,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 15 treesize of output 11 [2021-06-05 14:55:37,819 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:37,823 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:37,823 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:37,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:37,824 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:37,827 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:37,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:37,828 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:37,963 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-06-05 14:55:37,963 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:37,967 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:37,967 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:37,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 23 treesize of output 17 [2021-06-05 14:55:37,968 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:37,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:37,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:37,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 15 treesize of output 11 [2021-06-05 14:55:37,973 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:37,977 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:37,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 22 treesize of output 16 [2021-06-05 14:55:37,986 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:38,223 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2021-06-05 14:55:38,224 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.7 percent of original size [2021-06-05 14:55:38,231 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 14:55:38,231 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:949, output treesize:290 [2021-06-05 14:55:38,375 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-06-05 14:55:38,577 INFO L446 ElimStorePlain]: Different costs {0=[get_6, v_prenex_1552, v_prenex_1541, v_prenex_1543, v_prenex_1531, v_prenex_1545, v_prenex_1523, v_prenex_1533, v_prenex_1525, v_prenex_1535, v_prenex_1527, v_prenex_1537, v_prenex_1529, v_prenex_1539], 1=[get_3, v_prenex_1530, v_prenex_1551, v_prenex_1540, v_prenex_1532, v_prenex_1542, v_prenex_1534, v_prenex_1544, v_prenex_1522, v_prenex_1536, v_prenex_1524, v_prenex_1538, v_prenex_1526, v_prenex_1528]} [2021-06-05 14:55:38,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 15 treesize of output 11 [2021-06-05 14:55:38,588 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:39,055 WARN L205 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 105 [2021-06-05 14:55:39,055 INFO L628 ElimStorePlain]: treesize reduction 1107, result has 24.4 percent of original size [2021-06-05 14:55: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 9 treesize of output 7 [2021-06-05 14:55:39,061 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:39,195 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-06-05 14:55:39,195 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:39,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:39,201 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:39,345 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-06-05 14:55:39,346 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:39,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 7 treesize of output 5 [2021-06-05 14:55:39,351 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:39,498 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-06-05 14:55:39,499 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:39,499 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1531 vanished before elimination [2021-06-05 14:55:39,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 9 treesize of output 7 [2021-06-05 14:55:39,505 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:39,642 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-05 14:55:39,642 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:39,642 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1523 vanished before elimination [2021-06-05 14:55:39,642 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1533 vanished before elimination [2021-06-05 14:55:39,642 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1525 vanished before elimination [2021-06-05 14:55:39,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 16 treesize of output 12 [2021-06-05 14:55:39,647 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:39,786 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-06-05 14:55:39,786 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:39,786 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1527 vanished before elimination [2021-06-05 14:55:39,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 7 treesize of output 5 [2021-06-05 14:55:39,790 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:39,915 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-06-05 14:55:39,915 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:39,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 7 treesize of output 5 [2021-06-05 14:55:39,920 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:40,054 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-06-05 14:55:40,054 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:40,054 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1539 vanished before elimination [2021-06-05 14:55:40,054 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 14:55:40,054 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1530 vanished before elimination [2021-06-05 14:55:40,054 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1551 vanished before elimination [2021-06-05 14:55:40,054 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1540 vanished before elimination [2021-06-05 14:55:40,055 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1532 vanished before elimination [2021-06-05 14:55:40,055 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1542 vanished before elimination [2021-06-05 14:55:40,055 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1534 vanished before elimination [2021-06-05 14:55:40,055 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1544 vanished before elimination [2021-06-05 14:55:40,055 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1522 vanished before elimination [2021-06-05 14:55:40,055 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1536 vanished before elimination [2021-06-05 14:55:40,055 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1524 vanished before elimination [2021-06-05 14:55:40,055 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1538 vanished before elimination [2021-06-05 14:55:40,055 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1526 vanished before elimination [2021-06-05 14:55:40,055 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1528 vanished before elimination [2021-06-05 14:55:40,058 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 14:55:40,058 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 42 variables, input treesize:1471, output treesize:254 [2021-06-05 14:55:40,405 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2021-06-05 14:55:40,560 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2021-06-05 14:55:40,641 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 14:55:40,642 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211641108] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:55:40,642 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:55:40,642 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:55:40,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733641633] [2021-06-05 14:55:40,642 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:55:40,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:55:40,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:55:40,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:55:40,642 INFO L87 Difference]: Start difference. First operand 452 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 14:55:41,098 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2021-06-05 14:55:41,489 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 124 [2021-06-05 14:55:41,847 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2021-06-05 14:55:42,431 WARN L205 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 82 [2021-06-05 14:55:43,029 WARN L205 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 91 [2021-06-05 14:55:43,667 WARN L205 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 98 [2021-06-05 14:55:43,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:55:43,693 INFO L93 Difference]: Finished difference Result 697 states and 2016 transitions. [2021-06-05 14:55:43,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:55:43,693 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 14:55:43,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:55:43,694 INFO L225 Difference]: With dead ends: 697 [2021-06-05 14:55:43,694 INFO L226 Difference]: Without dead ends: 682 [2021-06-05 14:55:43,694 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 3740.6ms TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:55:43,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2021-06-05 14:55:43,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 450. [2021-06-05 14:55:43,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 3.084632516703786) internal successors, (1385), 449 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:55:43,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1385 transitions. [2021-06-05 14:55:43,699 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1385 transitions. Word has length 20 [2021-06-05 14:55:43,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:55:43,699 INFO L482 AbstractCegarLoop]: Abstraction has 450 states and 1385 transitions. [2021-06-05 14:55:43,699 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 14:55:43,699 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1385 transitions. [2021-06-05 14:55:43,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:55:43,700 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:55:43,700 INFO L521 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 14:55:43,900 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 276 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8651 [2021-06-05 14:55:43,900 INFO L430 AbstractCegarLoop]: === Iteration 467 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:55:43,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:55:43,901 INFO L82 PathProgramCache]: Analyzing trace with hash -82608552, now seen corresponding path program 75 times [2021-06-05 14:55:43,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:55:43,901 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078710910] [2021-06-05 14:55:43,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:55:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:55:44,250 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 14:55:44,250 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:55:44,250 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078710910] [2021-06-05 14:55:44,250 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078710910] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:55:44,250 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498270290] [2021-06-05 14:55:44,250 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 14:55:44,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:55:44,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:55:44,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 14:55:44,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:55:44,832 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:44,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:44,833 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:45,209 WARN L205 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 116 [2021-06-05 14:55:45,210 INFO L628 ElimStorePlain]: treesize reduction 203, result has 68.8 percent of original size [2021-06-05 14:55:45,215 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:45,215 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:45,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:45,216 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:45,221 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:45,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:45,225 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:45,382 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-05 14:55:45,383 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:45,395 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:45,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:45,396 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:45,554 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-05 14:55:45,554 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:45,559 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:45,559 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:45,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:45,560 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:45,565 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:45,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:45,566 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:45,713 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-06-05 14:55:45,714 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:45,718 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:45,719 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:45,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 14:55:45,720 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:45,728 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:45,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 14:55:45,729 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:45,874 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-06-05 14:55:45,875 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:45,880 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:45,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 15 treesize of output 11 [2021-06-05 14:55:45,881 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:46,024 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 14:55:46,024 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:46,038 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 14:55:46,038 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:657, output treesize:343 [2021-06-05 14:55:46,305 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 113 [2021-06-05 14:55:46,779 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2021-06-05 14:55:47,129 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1590, v_prenex_1592, v_prenex_1581, v_prenex_1572, v_prenex_1594, get_6, v_prenex_1583, v_prenex_1596, v_prenex_1574, v_prenex_1598, v_prenex_1576, v_prenex_1586, v_prenex_1578, v_prenex_1600, v_prenex_1588, v_prenex_1569, v_prenex_1604, v_prenex_1616, v_prenex_1607, v_prenex_1609], 1=[get_3, v_prenex_1591, v_prenex_1580, v_prenex_1571, v_prenex_1593, v_prenex_1582, v_prenex_1585, v_prenex_1595, v_prenex_1573, v_prenex_1587, v_prenex_1597, v_prenex_1575, v_prenex_1589, v_prenex_1599, v_prenex_1577, v_prenex_1568, v_prenex_1615, v_prenex_1603, v_prenex_1606, v_prenex_1608]} [2021-06-05 14:55:47,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 23 treesize of output 17 [2021-06-05 14:55:47,148 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:47,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:47,164 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:47,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:47,179 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:47,918 WARN L205 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 369 DAG size of output: 153 [2021-06-05 14:55:47,918 INFO L628 ElimStorePlain]: treesize reduction 1671, result has 23.1 percent of original size [2021-06-05 14:55:47,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 7 treesize of output 5 [2021-06-05 14:55:47,925 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:48,111 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2021-06-05 14:55:48,111 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:48,111 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1581 vanished before elimination [2021-06-05 14:55:48,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 14:55:48,119 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:48,338 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2021-06-05 14:55:48,338 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:48,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:48,347 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:48,563 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2021-06-05 14:55:48,563 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:48,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 7 treesize of output 5 [2021-06-05 14:55:48,571 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:48,776 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2021-06-05 14:55:48,776 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:48,776 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1583 vanished before elimination [2021-06-05 14:55:48,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 9 treesize of output 7 [2021-06-05 14:55:48,800 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:48,990 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2021-06-05 14:55:48,990 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:48,990 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1574 vanished before elimination [2021-06-05 14:55:48,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:48,997 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:49,184 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2021-06-05 14:55:49,185 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:49,185 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1576 vanished before elimination [2021-06-05 14:55:49,185 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1586 vanished before elimination [2021-06-05 14:55:49,185 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1578 vanished before elimination [2021-06-05 14:55:49,185 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1600 vanished before elimination [2021-06-05 14:55:49,185 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1588 vanished before elimination [2021-06-05 14:55:49,185 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1569 vanished before elimination [2021-06-05 14:55:49,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 16 treesize of output 12 [2021-06-05 14:55:49,192 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:49,391 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-06-05 14:55:49,391 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:49,397 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:49,398 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:49,579 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-05 14:55:49,579 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:49,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 14:55:49,586 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:49,771 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-06-05 14:55:49,771 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:49,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:49,777 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:49,953 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-06-05 14:55:49,964 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:49,964 INFO L518 ElimStorePlain]: Eliminatee get_3 vanished before elimination [2021-06-05 14:55:49,964 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1591 vanished before elimination [2021-06-05 14:55:49,965 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1580 vanished before elimination [2021-06-05 14:55:49,965 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1571 vanished before elimination [2021-06-05 14:55:49,965 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1593 vanished before elimination [2021-06-05 14:55:49,965 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1582 vanished before elimination [2021-06-05 14:55:49,965 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1585 vanished before elimination [2021-06-05 14:55:49,965 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1595 vanished before elimination [2021-06-05 14:55:49,965 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1573 vanished before elimination [2021-06-05 14:55:49,965 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1587 vanished before elimination [2021-06-05 14:55:49,965 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1597 vanished before elimination [2021-06-05 14:55:49,965 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1575 vanished before elimination [2021-06-05 14:55:49,965 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1589 vanished before elimination [2021-06-05 14:55:49,965 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1599 vanished before elimination [2021-06-05 14:55:49,965 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1577 vanished before elimination [2021-06-05 14:55:49,965 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1568 vanished before elimination [2021-06-05 14:55:49,965 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1615 vanished before elimination [2021-06-05 14:55:49,965 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1603 vanished before elimination [2021-06-05 14:55:49,965 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1606 vanished before elimination [2021-06-05 14:55:49,965 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1608 vanished before elimination [2021-06-05 14:55:49,971 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 14:55:49,971 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 60 variables, input treesize:2201, output treesize:346 [2021-06-05 14:55:50,242 WARN L205 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2021-06-05 14:55:50,456 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2021-06-05 14:55:50,591 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 14:55:50,592 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498270290] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:55:50,592 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:55:50,592 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:55:50,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035056291] [2021-06-05 14:55:50,592 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:55:50,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:55:50,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:55:50,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:55:50,592 INFO L87 Difference]: Start difference. First operand 450 states and 1385 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 14:55:51,126 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-06-05 14:55:51,825 WARN L205 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 170 [2021-06-05 14:55:52,165 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2021-06-05 14:55:52,725 WARN L205 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2021-06-05 14:55:53,379 WARN L205 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2021-06-05 14:55:53,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:55:53,392 INFO L93 Difference]: Finished difference Result 632 states and 1852 transitions. [2021-06-05 14:55:53,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:55:53,393 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 14:55:53,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:55:53,393 INFO L225 Difference]: With dead ends: 632 [2021-06-05 14:55:53,393 INFO L226 Difference]: Without dead ends: 611 [2021-06-05 14:55:53,394 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 4026.9ms TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:55:53,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-06-05 14:55:53,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 456. [2021-06-05 14:55:53,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 3.0923076923076924) internal successors, (1407), 455 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:55:53,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1407 transitions. [2021-06-05 14:55:53,398 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1407 transitions. Word has length 20 [2021-06-05 14:55:53,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:55:53,398 INFO L482 AbstractCegarLoop]: Abstraction has 456 states and 1407 transitions. [2021-06-05 14:55:53,398 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 14:55:53,399 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1407 transitions. [2021-06-05 14:55:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:55:53,399 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:55:53,399 INFO L521 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 14:55:53,599 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8771,277 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:55:53,600 INFO L430 AbstractCegarLoop]: === Iteration 468 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:55:53,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:55:53,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1252797548, now seen corresponding path program 76 times [2021-06-05 14:55:53,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:55:53,600 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239321681] [2021-06-05 14:55:53,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:55:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:55:54,110 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 14:55:54,110 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:55:54,110 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239321681] [2021-06-05 14:55:54,110 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239321681] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:55:54,110 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952350542] [2021-06-05 14:55:54,110 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 14:55:54,140 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:55:54,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:55:54,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:55:54,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:55:54,453 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:54,453 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:54,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 31 treesize of output 23 [2021-06-05 14:55:54,454 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:54,458 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:54,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:54,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 37 treesize of output 27 [2021-06-05 14:55:54,460 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:54,464 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:54,464 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:54,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:54,465 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:54,469 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:54,470 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:54,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:54,471 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:54,475 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:54,475 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:54,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:54,476 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:54,480 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:54,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:54,481 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:54,736 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2021-06-05 14:55:54,737 INFO L628 ElimStorePlain]: treesize reduction 331, result has 49.0 percent of original size [2021-06-05 14:55:54,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:54,741 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:54,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 14:55:54,742 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:54,745 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:54,745 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:54,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:54,746 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:54,749 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:54,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 22 treesize of output 16 [2021-06-05 14:55:54,750 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:54,860 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-06-05 14:55:54,860 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:55:54,864 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:54,864 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:54,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 22 treesize of output 16 [2021-06-05 14:55:54,865 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:54,868 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:54,868 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:54,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:55:54,869 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:54,872 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:55:54,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 23 treesize of output 17 [2021-06-05 14:55:54,873 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:55,055 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2021-06-05 14:55:55,055 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 14:55:55,061 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 14:55:55,061 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:841, output treesize:243 [2021-06-05 14:55:55,761 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 14:55:55,762 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952350542] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:55:55,762 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:55:55,762 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:55:55,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912881634] [2021-06-05 14:55:55,762 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:55:55,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:55:55,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:55:55,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:55:55,762 INFO L87 Difference]: Start difference. First operand 456 states and 1407 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 14:55:56,590 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 123 [2021-06-05 14:55:57,144 WARN L205 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 136 [2021-06-05 14:55:57,470 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2021-06-05 14:55:57,848 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 77 [2021-06-05 14:55:58,286 WARN L205 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 84 [2021-06-05 14:55:58,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:55:58,316 INFO L93 Difference]: Finished difference Result 633 states and 1858 transitions. [2021-06-05 14:55:58,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:55:58,316 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 14:55:58,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:55:58,317 INFO L225 Difference]: With dead ends: 633 [2021-06-05 14:55:58,317 INFO L226 Difference]: Without dead ends: 618 [2021-06-05 14:55:58,317 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 3172.7ms TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:55:58,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2021-06-05 14:55:58,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 453. [2021-06-05 14:55:58,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 3.088495575221239) internal successors, (1396), 452 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:55:58,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 1396 transitions. [2021-06-05 14:55:58,322 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 1396 transitions. Word has length 20 [2021-06-05 14:55:58,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:55:58,322 INFO L482 AbstractCegarLoop]: Abstraction has 453 states and 1396 transitions. [2021-06-05 14:55:58,322 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 14:55:58,322 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 1396 transitions. [2021-06-05 14:55:58,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:55:58,323 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:55:58,323 INFO L521 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 14:55:58,523 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 278 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8909 [2021-06-05 14:55:58,523 INFO L430 AbstractCegarLoop]: === Iteration 469 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:55:58,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:55:58,523 INFO L82 PathProgramCache]: Analyzing trace with hash -998472254, now seen corresponding path program 77 times [2021-06-05 14:55:58,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:55:58,523 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119779580] [2021-06-05 14:55:58,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:55:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:55:58,866 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 14:55:58,866 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:55:58,866 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119779580] [2021-06-05 14:55:58,866 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119779580] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:55:58,866 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805528695] [2021-06-05 14:55:58,866 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 14:55:58,891 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:55:58,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:55:58,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:55:58,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:55:59,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:59,038 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,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 38 treesize of output 28 [2021-06-05 14:55:59,043 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:59,047 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:59,051 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,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 38 treesize of output 28 [2021-06-05 14:55:59,055 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:59,059 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:59,064 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:59,068 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:59,072 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,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 37 treesize of output 27 [2021-06-05 14:55:59,076 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,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 45 treesize of output 33 [2021-06-05 14:55:59,080 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:59,084 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:59,097 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,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 14:55:59,101 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,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 30 treesize of output 22 [2021-06-05 14:55:59,104 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:59,108 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:59,112 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,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 31 treesize of output 23 [2021-06-05 14:55:59,116 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:59,120 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:59,124 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:59,128 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:59,132 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,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 44 treesize of output 32 [2021-06-05 14:55:59,136 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,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 37 treesize of output 27 [2021-06-05 14:55:59,140 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,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 37 treesize of output 27 [2021-06-05 14:55:59,144 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,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 30 treesize of output 22 [2021-06-05 14:55:59,148 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:59,152 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:59,156 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,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 31 treesize of output 23 [2021-06-05 14:55:59,159 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:59,163 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,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 36 treesize of output 26 [2021-06-05 14:55:59,167 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:59,171 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:59,174 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:59,178 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,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 30 treesize of output 22 [2021-06-05 14:55:59,182 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:55:59,185 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:55:59,331 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2021-06-05 14:55:59,331 INFO L628 ElimStorePlain]: treesize reduction 303, result has 39.0 percent of original size [2021-06-05 14:55:59,333 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:55:59,333 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1729, output treesize:194 [2021-06-05 14:55:59,628 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2021-06-05 14:55:59,920 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 14:55:59,920 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805528695] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:55:59,920 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:55:59,920 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:55:59,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145266457] [2021-06-05 14:55:59,920 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:55:59,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:55:59,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:55:59,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:55:59,921 INFO L87 Difference]: Start difference. First operand 453 states and 1396 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 14:56:00,573 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2021-06-05 14:56:00,974 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 92 [2021-06-05 14:56:01,413 WARN L205 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 99 [2021-06-05 14:56:01,579 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2021-06-05 14:56:01,762 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2021-06-05 14:56:01,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:56:01,782 INFO L93 Difference]: Finished difference Result 613 states and 1814 transitions. [2021-06-05 14:56:01,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:56:01,782 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 14:56:01,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:56:01,783 INFO L225 Difference]: With dead ends: 613 [2021-06-05 14:56:01,783 INFO L226 Difference]: Without dead ends: 598 [2021-06-05 14:56:01,783 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 2427.4ms TimeCoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:56:01,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2021-06-05 14:56:01,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 450. [2021-06-05 14:56:01,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 3.084632516703786) internal successors, (1385), 449 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:56:01,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1385 transitions. [2021-06-05 14:56:01,788 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1385 transitions. Word has length 20 [2021-06-05 14:56:01,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:56:01,788 INFO L482 AbstractCegarLoop]: Abstraction has 450 states and 1385 transitions. [2021-06-05 14:56:01,788 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 14:56:01,788 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1385 transitions. [2021-06-05 14:56:01,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:56:01,789 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:56:01,789 INFO L521 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 14:56:01,989 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9014,279 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:56:01,989 INFO L430 AbstractCegarLoop]: === Iteration 470 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:56:01,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:56:01,990 INFO L82 PathProgramCache]: Analyzing trace with hash 213400338, now seen corresponding path program 78 times [2021-06-05 14:56:01,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:56:01,990 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650336058] [2021-06-05 14:56:01,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:56:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:02,419 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 14:56:02,419 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:56:02,419 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650336058] [2021-06-05 14:56:02,419 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650336058] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:02,419 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816532452] [2021-06-05 14:56:02,419 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 14:56:02,444 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:56:02,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:56:02,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:56:02,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:56:02,735 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:02,735 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:02,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 30 treesize of output 22 [2021-06-05 14:56:02,736 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:02,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:02,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:02,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 22 treesize of output 16 [2021-06-05 14:56:02,741 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:02,745 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:02,745 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:02,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:02,746 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:02,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:02,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:02,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 22 treesize of output 16 [2021-06-05 14:56:02,751 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:02,754 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:02,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:02,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:02,756 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:02,759 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:02,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:02,760 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:02,985 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2021-06-05 14:56:02,985 INFO L628 ElimStorePlain]: treesize reduction 345, result has 46.7 percent of original size [2021-06-05 14:56:02,988 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:02,989 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:02,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:02,990 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:02,993 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:02,993 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:02,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:02,994 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:02,997 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:02,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:02,998 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:03,163 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2021-06-05 14:56:03,163 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 14:56:03,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:03,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:03,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 15 treesize of output 11 [2021-06-05 14:56:03,168 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:03,170 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:03,171 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:03,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:03,172 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:03,174 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:03,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:03,175 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:03,252 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:03,263 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 14:56:03,263 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:805, output treesize:218 [2021-06-05 14:56:03,564 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2021-06-05 14:56:03,961 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 14:56:03,961 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816532452] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:03,961 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:56:03,961 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:56:03,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455780891] [2021-06-05 14:56:03,961 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:56:03,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:56:03,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:56:03,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:56:03,962 INFO L87 Difference]: Start difference. First operand 450 states and 1385 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 14:56:04,700 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 130 [2021-06-05 14:56:05,235 WARN L205 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 139 [2021-06-05 14:56:05,466 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2021-06-05 14:56:05,764 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 78 [2021-06-05 14:56:06,261 WARN L205 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 89 [2021-06-05 14:56:06,528 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 84 [2021-06-05 14:56:06,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:56:06,533 INFO L93 Difference]: Finished difference Result 636 states and 1861 transitions. [2021-06-05 14:56:06,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:56:06,533 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 14:56:06,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:56:06,534 INFO L225 Difference]: With dead ends: 636 [2021-06-05 14:56:06,534 INFO L226 Difference]: Without dead ends: 621 [2021-06-05 14:56:06,534 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 3139.4ms TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:56:06,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2021-06-05 14:56:06,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 454. [2021-06-05 14:56:06,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 3.0927152317880795) internal successors, (1401), 453 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:56:06,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1401 transitions. [2021-06-05 14:56:06,539 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1401 transitions. Word has length 20 [2021-06-05 14:56:06,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:56:06,539 INFO L482 AbstractCegarLoop]: Abstraction has 454 states and 1401 transitions. [2021-06-05 14:56:06,539 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 14:56:06,539 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1401 transitions. [2021-06-05 14:56:06,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:56:06,540 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:56:06,540 INFO L521 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 14:56:06,740 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 280 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9049 [2021-06-05 14:56:06,740 INFO L430 AbstractCegarLoop]: === Iteration 471 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:56:06,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:56:06,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1353684174, now seen corresponding path program 79 times [2021-06-05 14:56:06,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:56:06,741 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475379613] [2021-06-05 14:56:06,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:56:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:07,109 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 14:56:07,109 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:56:07,109 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475379613] [2021-06-05 14:56:07,109 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475379613] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:07,109 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899899789] [2021-06-05 14:56:07,109 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 14:56:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:07,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:56:07,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:56:07,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:07,270 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:07,275 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:07,279 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:07,284 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,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 38 treesize of output 28 [2021-06-05 14:56:07,288 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:07,298 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,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 38 treesize of output 28 [2021-06-05 14:56:07,303 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:07,307 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:07,311 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,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 37 treesize of output 27 [2021-06-05 14:56:07,315 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,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 45 treesize of output 33 [2021-06-05 14:56:07,319 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,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 36 treesize of output 26 [2021-06-05 14:56:07,323 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:07,327 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:07,331 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:07,338 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:07,342 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,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 37 treesize of output 27 [2021-06-05 14:56:07,346 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:07,350 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:07,354 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:07,358 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,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 37 treesize of output 27 [2021-06-05 14:56:07,362 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,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 29 treesize of output 21 [2021-06-05 14:56:07,366 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,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 44 treesize of output 32 [2021-06-05 14:56:07,370 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,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 37 treesize of output 27 [2021-06-05 14:56:07,374 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,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 37 treesize of output 27 [2021-06-05 14:56:07,378 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,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 30 treesize of output 22 [2021-06-05 14:56:07,382 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,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 14:56:07,386 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,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 29 treesize of output 21 [2021-06-05 14:56:07,390 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,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 31 treesize of output 23 [2021-06-05 14:56:07,394 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,397 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:07,397 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,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 36 treesize of output 26 [2021-06-05 14:56:07,401 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,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 31 treesize of output 23 [2021-06-05 14:56:07,405 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:07,409 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:07,412 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:07,416 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:07,419 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:07,570 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2021-06-05 14:56:07,571 INFO L628 ElimStorePlain]: treesize reduction 303, result has 39.0 percent of original size [2021-06-05 14:56:07,572 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:56:07,572 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1729, output treesize:194 [2021-06-05 14:56:07,993 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 14:56:07,994 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899899789] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:07,994 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:56:07,994 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:56:07,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300528493] [2021-06-05 14:56:07,994 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:56:07,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:56:07,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:56:07,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:56:07,994 INFO L87 Difference]: Start difference. First operand 454 states and 1401 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 14:56:08,614 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 14:56:09,119 WARN L205 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 91 [2021-06-05 14:56:09,311 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2021-06-05 14:56:09,889 WARN L205 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2021-06-05 14:56:10,559 WARN L205 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2021-06-05 14:56:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:56:10,581 INFO L93 Difference]: Finished difference Result 643 states and 1879 transitions. [2021-06-05 14:56:10,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:56:10,582 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 14:56:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:56:10,582 INFO L225 Difference]: With dead ends: 643 [2021-06-05 14:56:10,582 INFO L226 Difference]: Without dead ends: 628 [2021-06-05 14:56:10,582 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2998.0ms TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:56:10,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2021-06-05 14:56:10,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 452. [2021-06-05 14:56:10,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 3.0864745011086474) internal successors, (1392), 451 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:56:10,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1392 transitions. [2021-06-05 14:56:10,587 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1392 transitions. Word has length 20 [2021-06-05 14:56:10,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:56:10,587 INFO L482 AbstractCegarLoop]: Abstraction has 452 states and 1392 transitions. [2021-06-05 14:56:10,587 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 14:56:10,587 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1392 transitions. [2021-06-05 14:56:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:56:10,588 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:56:10,588 INFO L521 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 14:56:10,788 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9153,281 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:56:10,788 INFO L430 AbstractCegarLoop]: === Iteration 472 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:56:10,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:56:10,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1422244324, now seen corresponding path program 80 times [2021-06-05 14:56:10,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:56:10,789 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235874988] [2021-06-05 14:56:10,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:56:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:11,039 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 14:56:11,039 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:56:11,039 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235874988] [2021-06-05 14:56:11,039 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235874988] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:11,039 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291519816] [2021-06-05 14:56:11,039 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 14:56:11,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:56:11,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:56:11,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:56:11,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:56:11,399 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:11,400 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:11,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:11,401 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:11,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:11,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:11,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 31 treesize of output 23 [2021-06-05 14:56:11,406 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:11,410 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:11,410 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:11,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 38 treesize of output 28 [2021-06-05 14:56:11,411 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:11,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:11,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:11,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:11,417 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:11,421 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:11,421 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:11,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:11,422 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:11,426 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:11,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:11,427 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:11,672 WARN L205 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2021-06-05 14:56:11,672 INFO L628 ElimStorePlain]: treesize reduction 343, result has 47.0 percent of original size [2021-06-05 14:56:11,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:11,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:11,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:11,677 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:11,681 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:11,681 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:11,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:11,682 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:11,685 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:11,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:11,686 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:11,878 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2021-06-05 14:56:11,879 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 14:56:11,882 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:11,882 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:11,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:11,883 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:11,886 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:11,886 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:11,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:11,887 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:11,890 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:11,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:11,891 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:11,980 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:11,986 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 14:56:11,986 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:841, output treesize:236 [2021-06-05 14:56:12,317 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2021-06-05 14:56:12,488 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 69 [2021-06-05 14:56:12,767 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 14:56:12,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291519816] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:12,767 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:56:12,767 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:56:12,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881593996] [2021-06-05 14:56:12,767 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:56:12,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:56:12,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:56:12,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:56:12,767 INFO L87 Difference]: Start difference. First operand 452 states and 1392 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 14:56:13,223 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2021-06-05 14:56:13,613 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 122 [2021-06-05 14:56:14,127 WARN L205 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 131 [2021-06-05 14:56:14,975 WARN L205 SmtUtils]: Spent 760.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 144 [2021-06-05 14:56:15,139 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2021-06-05 14:56:15,347 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2021-06-05 14:56:15,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:56:15,372 INFO L93 Difference]: Finished difference Result 606 states and 1799 transitions. [2021-06-05 14:56:15,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:56:15,372 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 14:56:15,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:56:15,373 INFO L225 Difference]: With dead ends: 606 [2021-06-05 14:56:15,373 INFO L226 Difference]: Without dead ends: 591 [2021-06-05 14:56:15,373 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 3098.2ms TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:56:15,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2021-06-05 14:56:15,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 450. [2021-06-05 14:56:15,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 3.084632516703786) internal successors, (1385), 449 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:56:15,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1385 transitions. [2021-06-05 14:56:15,378 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1385 transitions. Word has length 20 [2021-06-05 14:56:15,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:56:15,378 INFO L482 AbstractCegarLoop]: Abstraction has 450 states and 1385 transitions. [2021-06-05 14:56:15,378 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 14:56:15,378 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1385 transitions. [2021-06-05 14:56:15,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:56:15,379 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:56:15,379 INFO L521 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 14:56:15,579 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9186,282 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:56:15,579 INFO L430 AbstractCegarLoop]: === Iteration 473 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:56:15,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:56:15,579 INFO L82 PathProgramCache]: Analyzing trace with hash 937121676, now seen corresponding path program 81 times [2021-06-05 14:56:15,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:56:15,579 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101915670] [2021-06-05 14:56:15,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:56:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:15,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 14:56:15,792 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:56:15,792 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101915670] [2021-06-05 14:56:15,792 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101915670] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:15,792 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956518733] [2021-06-05 14:56:15,792 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 14:56:15,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:56:15,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:56:15,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:56:15,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:56:16,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:16,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:16,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:16,075 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:16,080 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:16,080 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:16,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 30 treesize of output 22 [2021-06-05 14:56:16,081 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:16,085 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:16,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:16,086 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:16,319 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2021-06-05 14:56:16,320 INFO L628 ElimStorePlain]: treesize reduction 114, result has 74.2 percent of original size [2021-06-05 14:56:16,324 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:16,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 15 treesize of output 11 [2021-06-05 14:56:16,325 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:16,435 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-06-05 14:56:16,435 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:16,439 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:16,439 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:16,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 15 treesize of output 11 [2021-06-05 14:56:16,440 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:16,444 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:16,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 23 treesize of output 17 [2021-06-05 14:56:16,445 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:16,551 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-06-05 14:56:16,552 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:16,556 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:16,556 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:16,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 14:56:16,557 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:16,561 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:16,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 23 treesize of output 17 [2021-06-05 14:56:16,562 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:16,655 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:16,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:16,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:16,660 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:16,752 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:16,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:16,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:16,756 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:16,849 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:16,855 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 14:56:16,855 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:525, output treesize:234 [2021-06-05 14:56:17,018 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 98 [2021-06-05 14:56:17,539 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 103 [2021-06-05 14:56:18,401 WARN L205 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 121 [2021-06-05 14:56:19,293 WARN L205 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 120 [2021-06-05 14:56:19,612 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 114 [2021-06-05 14:56:20,814 WARN L205 SmtUtils]: Spent 909.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 120 [2021-06-05 14:56:21,718 WARN L205 SmtUtils]: Spent 776.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 121 [2021-06-05 14:56:21,940 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 113 [2021-06-05 14:56:22,080 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 128 [2021-06-05 14:56:23,178 WARN L205 SmtUtils]: Spent 987.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 120 [2021-06-05 14:56:23,496 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 121 [2021-06-05 14:56:23,800 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1680, v_prenex_1690, get_6, v_prenex_1682, v_prenex_1692, v_prenex_1684, v_prenex_1694, v_prenex_1686, v_prenex_1696, v_prenex_1688, v_prenex_1676, v_prenex_1678], 1=[v_prenex_1691, v_prenex_1693, v_prenex_1681, v_prenex_1695, v_prenex_1683, v_prenex_1697, v_prenex_1685, v_prenex_1677, get_0, v_prenex_1687, v_prenex_1679, v_prenex_1689]} [2021-06-05 14:56:23,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:23,818 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:23,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 31 treesize of output 23 [2021-06-05 14:56:23,828 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:23,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 31 treesize of output 23 [2021-06-05 14:56:23,837 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:24,166 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 92 [2021-06-05 14:56:24,166 INFO L628 ElimStorePlain]: treesize reduction 892, result has 23.6 percent of original size [2021-06-05 14:56:24,166 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1690 vanished before elimination [2021-06-05 14:56:24,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:24,171 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:24,262 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:24,263 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1682 vanished before elimination [2021-06-05 14:56:24,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:24,268 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:24,358 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:24,358 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1684 vanished before elimination [2021-06-05 14:56:24,358 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1694 vanished before elimination [2021-06-05 14:56:24,358 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1686 vanished before elimination [2021-06-05 14:56:24,358 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1696 vanished before elimination [2021-06-05 14:56:24,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:24,363 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:24,453 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:24,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 16 treesize of output 12 [2021-06-05 14:56:24,458 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:24,550 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:24,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 7 treesize of output 5 [2021-06-05 14:56:24,554 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:24,642 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:24,642 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1691 vanished before elimination [2021-06-05 14:56:24,642 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1693 vanished before elimination [2021-06-05 14:56:24,642 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1681 vanished before elimination [2021-06-05 14:56:24,642 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1695 vanished before elimination [2021-06-05 14:56:24,642 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1683 vanished before elimination [2021-06-05 14:56:24,642 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1697 vanished before elimination [2021-06-05 14:56:24,642 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1685 vanished before elimination [2021-06-05 14:56:24,642 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1677 vanished before elimination [2021-06-05 14:56:24,643 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 14:56:24,643 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1687 vanished before elimination [2021-06-05 14:56:24,643 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1679 vanished before elimination [2021-06-05 14:56:24,643 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1689 vanished before elimination [2021-06-05 14:56:24,646 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 14:56:24,646 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 36 variables, input treesize:1275, output treesize:187 [2021-06-05 14:56:24,829 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 14:56:24,829 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956518733] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:24,829 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:56:24,829 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:56:24,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857337662] [2021-06-05 14:56:24,829 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:56:24,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:56:24,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:56:24,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:56:24,830 INFO L87 Difference]: Start difference. First operand 450 states and 1385 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 14:56:25,196 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 136 [2021-06-05 14:56:25,673 WARN L205 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 147 [2021-06-05 14:56:25,850 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2021-06-05 14:56:26,945 WARN L205 SmtUtils]: Spent 982.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 215 [2021-06-05 14:56:27,106 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2021-06-05 14:56:28,383 WARN L205 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 263 DAG size of output: 223 [2021-06-05 14:56:28,591 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2021-06-05 14:56:29,876 WARN L205 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 267 DAG size of output: 227 [2021-06-05 14:56:30,083 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2021-06-05 14:56:31,470 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 278 DAG size of output: 234 [2021-06-05 14:56:31,773 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2021-06-05 14:56:31,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:56:31,814 INFO L93 Difference]: Finished difference Result 922 states and 2733 transitions. [2021-06-05 14:56:31,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 14:56:31,814 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 14:56:31,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:56:31,816 INFO L225 Difference]: With dead ends: 922 [2021-06-05 14:56:31,816 INFO L226 Difference]: Without dead ends: 889 [2021-06-05 14:56:31,816 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 7518.3ms TimeCoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2021-06-05 14:56:31,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2021-06-05 14:56:31,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 454. [2021-06-05 14:56:31,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 3.088300220750552) internal successors, (1399), 453 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:56:31,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1399 transitions. [2021-06-05 14:56:31,822 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1399 transitions. Word has length 20 [2021-06-05 14:56:31,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:56:31,822 INFO L482 AbstractCegarLoop]: Abstraction has 454 states and 1399 transitions. [2021-06-05 14:56:31,822 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 14:56:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1399 transitions. [2021-06-05 14:56:31,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:56:31,822 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:56:31,822 INFO L521 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 14:56:32,022 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 283 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9273 [2021-06-05 14:56:32,023 INFO L430 AbstractCegarLoop]: === Iteration 474 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:56:32,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:56:32,023 INFO L82 PathProgramCache]: Analyzing trace with hash 844201320, now seen corresponding path program 82 times [2021-06-05 14:56:32,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:56:32,023 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512925210] [2021-06-05 14:56:32,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:56:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:32,213 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 14:56:32,214 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:56:32,214 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512925210] [2021-06-05 14:56:32,214 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512925210] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:32,214 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967308358] [2021-06-05 14:56:32,214 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 14:56:32,239 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:56:32,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:56:32,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 14:56:32,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:56:32,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:32,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 15 treesize of output 11 [2021-06-05 14:56:32,660 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:32,982 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 112 [2021-06-05 14:56:32,982 INFO L628 ElimStorePlain]: treesize reduction 188, result has 68.1 percent of original size [2021-06-05 14:56:32,987 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:32,987 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:32,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 23 treesize of output 17 [2021-06-05 14:56:32,988 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:32,993 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:32,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:32,994 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,129 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-05 14:56:33,129 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:33,134 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:33,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 15 treesize of output 11 [2021-06-05 14:56:33,135 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,268 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-05 14:56:33,268 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:33,278 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:33,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:33,279 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,427 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-06-05 14:56:33,428 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:33,432 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:33,432 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:33,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:33,433 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,437 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:33,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 23 treesize of output 17 [2021-06-05 14:56:33,439 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,563 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 14:56:33,563 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:33,568 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:33,568 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:33,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 15 treesize of output 11 [2021-06-05 14:56:33,569 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,573 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:33,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 14:56:33,574 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:33,693 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 14:56:33,694 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:33,701 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 14:56:33,701 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:597, output treesize:298 [2021-06-05 14:56:33,904 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 109 [2021-06-05 14:56:34,712 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 117 [2021-06-05 14:56:35,055 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1735, v_prenex_1737, v_prenex_1729, v_prenex_1739, get_6, v_prenex_1741, v_prenex_1731, v_prenex_1733], 1=[v_prenex_1736, v_prenex_1738, v_prenex_1730, v_prenex_1740, get_0, v_prenex_1732, v_prenex_1742, v_prenex_1734]} [2021-06-05 14:56:35,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:35,067 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:35,078 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,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 22 treesize of output 16 [2021-06-05 14:56:35,090 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,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 29 treesize of output 21 [2021-06-05 14:56:35,101 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:35,112 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:35,123 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,768 WARN L205 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 125 [2021-06-05 14:56:35,768 INFO L628 ElimStorePlain]: treesize reduction 2139, result has 15.5 percent of original size [2021-06-05 14:56:35,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:35,775 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:35,915 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-06-05 14:56:35,915 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:35,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 16 treesize of output 12 [2021-06-05 14:56:35,922 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:36,058 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-06-05 14:56:36,058 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:36,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:36,064 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:36,200 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-05 14:56:36,200 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:36,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 16 treesize of output 12 [2021-06-05 14:56:36,206 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:36,335 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-05 14:56:36,336 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:36,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:36,341 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:36,470 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-06-05 14:56:36,470 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:36,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 7 treesize of output 5 [2021-06-05 14:56:36,475 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:36,601 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-06-05 14:56:36,602 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:36,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 14:56:36,607 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:36,736 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-06-05 14:56:36,737 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:36,737 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1736 vanished before elimination [2021-06-05 14:56:36,737 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1738 vanished before elimination [2021-06-05 14:56:36,737 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1730 vanished before elimination [2021-06-05 14:56:36,737 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1740 vanished before elimination [2021-06-05 14:56:36,737 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 14:56:36,737 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1732 vanished before elimination [2021-06-05 14:56:36,737 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1742 vanished before elimination [2021-06-05 14:56:36,737 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1734 vanished before elimination [2021-06-05 14:56:36,741 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 16 dim-1 vars, End of recursive call: and 14 xjuncts. [2021-06-05 14:56:36,742 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 24 variables, input treesize:2647, output treesize:278 [2021-06-05 14:56:36,937 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2021-06-05 14:56:37,058 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 14:56:37,058 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967308358] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:37,058 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:56:37,058 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:56:37,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593119824] [2021-06-05 14:56:37,059 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:56:37,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:56:37,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:56:37,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:56:37,059 INFO L87 Difference]: Start difference. First operand 454 states and 1399 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 14:56:37,395 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-06-05 14:56:37,892 WARN L205 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 134 [2021-06-05 14:56:38,489 WARN L205 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 139 [2021-06-05 14:56:38,634 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2021-06-05 14:56:39,390 WARN L205 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 208 [2021-06-05 14:56:39,652 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2021-06-05 14:56:40,421 WARN L205 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 158 [2021-06-05 14:56:40,552 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2021-06-05 14:56:41,206 WARN L205 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 167 [2021-06-05 14:56:41,349 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2021-06-05 14:56:41,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:56:41,375 INFO L93 Difference]: Finished difference Result 906 states and 2631 transitions. [2021-06-05 14:56:41,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 14:56:41,375 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 14:56:41,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:56:41,376 INFO L225 Difference]: With dead ends: 906 [2021-06-05 14:56:41,376 INFO L226 Difference]: Without dead ends: 864 [2021-06-05 14:56:41,376 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 5216.3ms TimeCoverageRelationStatistics Valid=180, Invalid=750, Unknown=0, NotChecked=0, Total=930 [2021-06-05 14:56:41,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2021-06-05 14:56:41,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 462. [2021-06-05 14:56:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 3.0954446854663775) internal successors, (1427), 461 states have internal predecessors, (1427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:56:41,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1427 transitions. [2021-06-05 14:56:41,382 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1427 transitions. Word has length 20 [2021-06-05 14:56:41,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:56:41,382 INFO L482 AbstractCegarLoop]: Abstraction has 462 states and 1427 transitions. [2021-06-05 14:56:41,382 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 14:56:41,382 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1427 transitions. [2021-06-05 14:56:41,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:56:41,383 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:56:41,383 INFO L521 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 14:56:41,583 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9383,284 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:56:41,583 INFO L430 AbstractCegarLoop]: === Iteration 475 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:56:41,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:56:41,583 INFO L82 PathProgramCache]: Analyzing trace with hash 637193638, now seen corresponding path program 83 times [2021-06-05 14:56:41,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:56:41,584 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696356684] [2021-06-05 14:56:41,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:56:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:41,924 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 14:56:41,924 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:56:41,924 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696356684] [2021-06-05 14:56:41,924 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696356684] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:41,924 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5688459] [2021-06-05 14:56:41,924 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 14:56:41,953 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:56:41,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:56:41,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:56:41,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:56:42,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:42,073 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:42,077 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:42,081 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,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 36 treesize of output 26 [2021-06-05 14:56:42,085 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:42,089 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:42,093 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:42,097 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,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 29 treesize of output 21 [2021-06-05 14:56:42,101 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56: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 36 treesize of output 26 [2021-06-05 14:56:42,105 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:42,109 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,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 30 treesize of output 22 [2021-06-05 14:56:42,113 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,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 38 treesize of output 28 [2021-06-05 14:56:42,117 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,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 29 treesize of output 21 [2021-06-05 14:56:42,121 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,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 30 treesize of output 22 [2021-06-05 14:56:42,124 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:42,128 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:42,132 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,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 37 treesize of output 27 [2021-06-05 14:56:42,136 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,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 44 treesize of output 32 [2021-06-05 14:56:42,140 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,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 38 treesize of output 28 [2021-06-05 14:56:42,143 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:42,147 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:42,151 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,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 37 treesize of output 27 [2021-06-05 14:56:42,155 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:42,159 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:42,163 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:42,167 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:42,171 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:42,175 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:42,179 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:42,194 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:42,198 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:42,202 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,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 29 treesize of output 21 [2021-06-05 14:56:42,205 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:42,209 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,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 31 treesize of output 23 [2021-06-05 14:56:42,212 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:42,215 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,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 30 treesize of output 22 [2021-06-05 14:56:42,218 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:42,330 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2021-06-05 14:56:42,330 INFO L628 ElimStorePlain]: treesize reduction 258, result has 36.6 percent of original size [2021-06-05 14:56:42,331 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:56:42,331 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1549, output treesize:149 [2021-06-05 14:56:42,774 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 14:56:42,775 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5688459] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:42,775 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:56:42,775 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:56:42,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432121819] [2021-06-05 14:56:42,775 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:56:42,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:56:42,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:56:42,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:56:42,775 INFO L87 Difference]: Start difference. First operand 462 states and 1427 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 14:56:43,186 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2021-06-05 14:56:43,577 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 76 [2021-06-05 14:56:44,019 WARN L205 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 86 [2021-06-05 14:56:44,532 WARN L205 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 94 [2021-06-05 14:56:45,146 WARN L205 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 109 [2021-06-05 14:56:45,845 WARN L205 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 112 [2021-06-05 14:56:45,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:56:45,860 INFO L93 Difference]: Finished difference Result 823 states and 2383 transitions. [2021-06-05 14:56:45,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:56:45,861 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 14:56:45,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:56:45,862 INFO L225 Difference]: With dead ends: 823 [2021-06-05 14:56:45,862 INFO L226 Difference]: Without dead ends: 802 [2021-06-05 14:56:45,862 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 3494.4ms TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:56:45,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2021-06-05 14:56:45,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 464. [2021-06-05 14:56:45,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 3.09719222462203) internal successors, (1434), 463 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:56:45,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1434 transitions. [2021-06-05 14:56:45,868 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1434 transitions. Word has length 20 [2021-06-05 14:56:45,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:56:45,868 INFO L482 AbstractCegarLoop]: Abstraction has 464 states and 1434 transitions. [2021-06-05 14:56:45,868 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 14:56:45,868 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1434 transitions. [2021-06-05 14:56:45,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:56:45,868 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:56:45,868 INFO L521 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 14:56:46,069 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 285 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9534 [2021-06-05 14:56:46,069 INFO L430 AbstractCegarLoop]: === Iteration 476 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:56:46,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:56:46,069 INFO L82 PathProgramCache]: Analyzing trace with hash -581441722, now seen corresponding path program 84 times [2021-06-05 14:56:46,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:56:46,069 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264983621] [2021-06-05 14:56:46,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:56:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:46,303 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 14:56:46,303 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:56:46,303 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264983621] [2021-06-05 14:56:46,303 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264983621] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:46,303 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494914819] [2021-06-05 14:56:46,303 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 14:56:46,329 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:56:46,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:56:46,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:56:46,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:56:46,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:46,429 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 14:56:46,433 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 44 treesize of output 32 [2021-06-05 14:56:46,437 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 36 treesize of output 26 [2021-06-05 14:56:46,441 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 38 treesize of output 28 [2021-06-05 14:56:46,445 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 37 treesize of output 27 [2021-06-05 14:56:46,449 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 30 treesize of output 22 [2021-06-05 14:56:46,453 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 30 treesize of output 22 [2021-06-05 14:56:46,456 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 38 treesize of output 28 [2021-06-05 14:56:46,460 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:46,464 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 31 treesize of output 23 [2021-06-05 14:56:46,468 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 30 treesize of output 22 [2021-06-05 14:56:46,472 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:46,476 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 29 treesize of output 21 [2021-06-05 14:56:46,479 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 37 treesize of output 27 [2021-06-05 14:56:46,483 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:46,487 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:46,490 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 36 treesize of output 26 [2021-06-05 14:56:46,494 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 37 treesize of output 27 [2021-06-05 14:56:46,498 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:46,502 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 38 treesize of output 28 [2021-06-05 14:56:46,506 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 43 treesize of output 31 [2021-06-05 14:56:46,509 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 37 treesize of output 27 [2021-06-05 14:56:46,513 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 29 treesize of output 21 [2021-06-05 14:56:46,517 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 14:56:46,520 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:46,524 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 30 treesize of output 22 [2021-06-05 14:56:46,528 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:46,531 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 30 treesize of output 22 [2021-06-05 14:56:46,535 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 45 treesize of output 33 [2021-06-05 14:56:46,538 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 30 treesize of output 22 [2021-06-05 14:56:46,542 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 31 treesize of output 23 [2021-06-05 14:56:46,545 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 37 treesize of output 27 [2021-06-05 14:56:46,549 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 37 treesize of output 27 [2021-06-05 14:56:46,552 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 37 treesize of output 27 [2021-06-05 14:56:46,555 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,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 29 treesize of output 21 [2021-06-05 14:56:46,558 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:46,664 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2021-06-05 14:56:46,665 INFO L628 ElimStorePlain]: treesize reduction 258, result has 36.6 percent of original size [2021-06-05 14:56:46,666 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:56:46,666 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1549, output treesize:149 [2021-06-05 14:56:47,097 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 14:56:47,097 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494914819] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:47,097 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:56:47,097 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:56:47,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525760107] [2021-06-05 14:56:47,098 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:56:47,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:56:47,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:56:47,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:56:47,098 INFO L87 Difference]: Start difference. First operand 464 states and 1434 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 14:56:47,369 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2021-06-05 14:56:47,774 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2021-06-05 14:56:48,253 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2021-06-05 14:56:48,395 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2021-06-05 14:56:48,825 WARN L205 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2021-06-05 14:56:48,992 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2021-06-05 14:56:49,447 WARN L205 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2021-06-05 14:56:49,634 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2021-06-05 14:56:50,163 WARN L205 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2021-06-05 14:56:50,353 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2021-06-05 14:56:50,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:56:50,368 INFO L93 Difference]: Finished difference Result 952 states and 2721 transitions. [2021-06-05 14:56:50,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 14:56:50,368 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 14:56:50,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:56:50,370 INFO L225 Difference]: With dead ends: 952 [2021-06-05 14:56:50,370 INFO L226 Difference]: Without dead ends: 914 [2021-06-05 14:56:50,370 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 3570.6ms TimeCoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2021-06-05 14:56:50,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2021-06-05 14:56:50,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 466. [2021-06-05 14:56:50,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 3.0946236559139786) internal successors, (1439), 465 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:56:50,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1439 transitions. [2021-06-05 14:56:50,376 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1439 transitions. Word has length 20 [2021-06-05 14:56:50,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:56:50,376 INFO L482 AbstractCegarLoop]: Abstraction has 466 states and 1439 transitions. [2021-06-05 14:56:50,376 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 14:56:50,376 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1439 transitions. [2021-06-05 14:56:50,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:56:50,376 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:56:50,376 INFO L521 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 14:56:50,577 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 286 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9561 [2021-06-05 14:56:50,577 INFO L430 AbstractCegarLoop]: === Iteration 477 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:56:50,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:56:50,577 INFO L82 PathProgramCache]: Analyzing trace with hash -2058431408, now seen corresponding path program 85 times [2021-06-05 14:56:50,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:56:50,577 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499761146] [2021-06-05 14:56:50,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:56:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:50,764 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 14:56:50,764 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:56:50,764 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499761146] [2021-06-05 14:56:50,764 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499761146] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:50,765 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065652529] [2021-06-05 14:56:50,765 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 14:56:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:50,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:56:50,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:56:51,035 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:51,036 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:51,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 30 treesize of output 22 [2021-06-05 14:56:51,037 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:51,041 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:51,041 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:51,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 22 treesize of output 16 [2021-06-05 14:56:51,042 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:51,045 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:51,046 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:51,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 22 treesize of output 16 [2021-06-05 14:56:51,047 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:51,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:51,051 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:51,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 29 treesize of output 21 [2021-06-05 14:56:51,051 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:51,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:51,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56: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 23 treesize of output 17 [2021-06-05 14:56:51,056 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:51,060 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:51,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:51,060 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:51,265 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2021-06-05 14:56:51,266 INFO L628 ElimStorePlain]: treesize reduction 315, result has 47.2 percent of original size [2021-06-05 14:56:51,269 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:51,270 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:51,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:51,271 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:51,273 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:51,274 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:51,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:51,275 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:51,277 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:51,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:51,279 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:51,424 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2021-06-05 14:56:51,424 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.5 percent of original size [2021-06-05 14:56:51,427 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:51,427 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:51,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 14:56:51,428 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:51,431 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:51,431 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:51,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:51,432 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:51,435 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:51,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 14:56:51,435 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:51,503 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:51,508 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 14:56:51,508 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:751, output treesize:183 [2021-06-05 14:56:52,203 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 14:56:52,203 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065652529] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:52,203 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:56:52,203 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:56:52,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131905083] [2021-06-05 14:56:52,203 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:56:52,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:56:52,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:56:52,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:56:52,204 INFO L87 Difference]: Start difference. First operand 466 states and 1439 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 14:56:52,825 WARN L205 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 108 [2021-06-05 14:56:53,305 WARN L205 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 114 [2021-06-05 14:56:53,453 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2021-06-05 14:56:53,846 WARN L205 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 121 [2021-06-05 14:56:54,037 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2021-06-05 14:56:54,510 WARN L205 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 129 [2021-06-05 14:56:54,704 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2021-06-05 14:56:55,212 WARN L205 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 136 [2021-06-05 14:56:55,403 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2021-06-05 14:56:55,639 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 111 [2021-06-05 14:56:55,932 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 117 [2021-06-05 14:56:55,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:56:55,933 INFO L93 Difference]: Finished difference Result 1129 states and 3177 transitions. [2021-06-05 14:56:55,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 14:56:55,933 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 14:56:55,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:56:55,934 INFO L225 Difference]: With dead ends: 1129 [2021-06-05 14:56:55,934 INFO L226 Difference]: Without dead ends: 1081 [2021-06-05 14:56:55,934 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 4084.1ms TimeCoverageRelationStatistics Valid=221, Invalid=835, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 14:56:55,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2021-06-05 14:56:55,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 478. [2021-06-05 14:56:55,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 3.0838574423480085) internal successors, (1471), 477 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:56:55,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1471 transitions. [2021-06-05 14:56:55,941 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1471 transitions. Word has length 20 [2021-06-05 14:56:55,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:56:55,942 INFO L482 AbstractCegarLoop]: Abstraction has 478 states and 1471 transitions. [2021-06-05 14:56:55,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 14:56:55,942 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1471 transitions. [2021-06-05 14:56:55,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:56:55,942 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:56:55,942 INFO L521 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 14:56:56,142 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9586,287 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:56:56,143 INFO L430 AbstractCegarLoop]: === Iteration 478 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:56:56,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:56:56,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1744944628, now seen corresponding path program 86 times [2021-06-05 14:56:56,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:56:56,143 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693531200] [2021-06-05 14:56:56,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:56:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:56:56,393 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 14:56:56,393 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:56:56,393 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693531200] [2021-06-05 14:56:56,393 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693531200] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:56:56,393 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028814261] [2021-06-05 14:56:56,394 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 14:56:56,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:56:56,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:56:56,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:56:56,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:56:56,846 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:56,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:56,847 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,118 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 105 [2021-06-05 14:56:57,119 INFO L628 ElimStorePlain]: treesize reduction 179, result has 67.7 percent of original size [2021-06-05 14:56:57,123 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:57,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 15 treesize of output 11 [2021-06-05 14:56:57,124 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,253 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2021-06-05 14:56:57,253 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:57,257 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:57,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 14:56:57,258 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,384 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-06-05 14:56:57,384 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:57,389 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:57,389 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:57,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:57,390 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,394 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:57,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:57,395 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,507 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-06-05 14:56:57,508 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:57,512 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:57,512 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:57,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 23 treesize of output 17 [2021-06-05 14:56:57,513 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,517 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:57,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:57,518 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,629 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-06-05 14:56:57,629 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:57,633 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:57,633 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:57,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:57,634 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,638 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:56:57,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:56:57,639 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:57,741 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-06-05 14:56:57,741 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:57,748 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 14:56:57,748 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:561, output treesize:261 [2021-06-05 14:56:57,931 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 100 [2021-06-05 14:56:58,369 WARN L205 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 124 [2021-06-05 14:56:58,645 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2021-06-05 14:56:58,920 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2021-06-05 14:56:59,150 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1802, v_prenex_1790, get_6, v_prenex_1780, v_prenex_1794, v_prenex_1782, v_prenex_1796, v_prenex_1784, v_prenex_1798, v_prenex_1786, v_prenex_1800, v_prenex_1788], 1=[v_prenex_1801, v_prenex_1803, v_prenex_1781, v_prenex_1791, v_prenex_1783, v_prenex_1785, v_prenex_1795, v_prenex_1787, get_0, v_prenex_1797, v_prenex_1789, v_prenex_1799]} [2021-06-05 14:56:59,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 15 treesize of output 11 [2021-06-05 14:56:59,160 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:59,507 WARN L205 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 99 [2021-06-05 14:56:59,507 INFO L628 ElimStorePlain]: treesize reduction 974, result has 22.9 percent of original size [2021-06-05 14:56:59,507 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1790 vanished before elimination [2021-06-05 14:56:59,507 INFO L518 ElimStorePlain]: Eliminatee get_6 vanished before elimination [2021-06-05 14:56:59,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 16 treesize of output 12 [2021-06-05 14:56:59,512 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:59,605 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:59,605 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1794 vanished before elimination [2021-06-05 14:56:59,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:56:59,610 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:59,703 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:59,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 7 treesize of output 5 [2021-06-05 14:56:59,708 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:59,805 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:59,806 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1784 vanished before elimination [2021-06-05 14:56:59,806 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1798 vanished before elimination [2021-06-05 14:56:59,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 7 treesize of output 5 [2021-06-05 14:56:59,810 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:59,898 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:59,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 7 treesize of output 5 [2021-06-05 14:56:59,903 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:56:59,989 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:56:59,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 16 treesize of output 12 [2021-06-05 14:56:59,993 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:00,074 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:00,075 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1801 vanished before elimination [2021-06-05 14:57:00,075 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1803 vanished before elimination [2021-06-05 14:57:00,075 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1781 vanished before elimination [2021-06-05 14:57:00,075 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1791 vanished before elimination [2021-06-05 14:57:00,075 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1783 vanished before elimination [2021-06-05 14:57:00,075 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1785 vanished before elimination [2021-06-05 14:57:00,075 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1795 vanished before elimination [2021-06-05 14:57:00,075 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1787 vanished before elimination [2021-06-05 14:57:00,075 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 14:57:00,075 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1797 vanished before elimination [2021-06-05 14:57:00,075 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1789 vanished before elimination [2021-06-05 14:57:00,075 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1799 vanished before elimination [2021-06-05 14:57:00,081 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 14:57:00,081 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 36 variables, input treesize:1271, output treesize:187 [2021-06-05 14:57:00,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 14:57:00,251 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028814261] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:00,252 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:57:00,252 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:57:00,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069920749] [2021-06-05 14:57:00,252 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:57:00,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:57:00,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:57:00,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:57:00,252 INFO L87 Difference]: Start difference. First operand 478 states and 1471 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 14:57:00,627 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 116 [2021-06-05 14:57:01,227 WARN L205 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 202 [2021-06-05 14:57:01,931 WARN L205 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 206 [2021-06-05 14:57:03,006 WARN L205 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 232 DAG size of output: 214 [2021-06-05 14:57:03,986 WARN L205 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 221 [2021-06-05 14:57:04,982 WARN L205 SmtUtils]: Spent 938.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 230 [2021-06-05 14:57:05,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:57:05,001 INFO L93 Difference]: Finished difference Result 882 states and 2579 transitions. [2021-06-05 14:57:05,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:57:05,001 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 14:57:05,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:57:05,003 INFO L225 Difference]: With dead ends: 882 [2021-06-05 14:57:05,003 INFO L226 Difference]: Without dead ends: 855 [2021-06-05 14:57:05,003 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 5659.1ms TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:57:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2021-06-05 14:57:05,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 481. [2021-06-05 14:57:05,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 3.08125) internal successors, (1479), 480 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:57:05,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1479 transitions. [2021-06-05 14:57:05,009 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 1479 transitions. Word has length 20 [2021-06-05 14:57:05,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:57:05,009 INFO L482 AbstractCegarLoop]: Abstraction has 481 states and 1479 transitions. [2021-06-05 14:57:05,009 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 14:57:05,009 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1479 transitions. [2021-06-05 14:57:05,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:57:05,010 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:57:05,010 INFO L521 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 14:57:05,210 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 288 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9673 [2021-06-05 14:57:05,210 INFO L430 AbstractCegarLoop]: === Iteration 479 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:57:05,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:57:05,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1265659952, now seen corresponding path program 87 times [2021-06-05 14:57:05,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:57:05,210 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39848999] [2021-06-05 14:57:05,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:57:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:57:05,560 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 14:57:05,560 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:57:05,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39848999] [2021-06-05 14:57:05,560 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39848999] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:05,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165656524] [2021-06-05 14:57:05,560 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 14:57:05,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:57:05,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:57:05,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:57:05,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:57:05,810 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:05,810 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:05,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:05,811 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:05,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:05,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:05,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:05,816 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:05,820 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:05,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:05,821 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,030 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2021-06-05 14:57:06,030 INFO L628 ElimStorePlain]: treesize reduction 140, result has 67.9 percent of original size [2021-06-05 14:57:06,034 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:06,034 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:06,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 14:57:06,035 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,039 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:06,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 14:57:06,040 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,128 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:06,131 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:06,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:06,132 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,218 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:06,222 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:06,222 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:06,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:06,223 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,227 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:06,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:06,228 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,302 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:06,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:06,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 15 treesize of output 11 [2021-06-05 14:57:06,307 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,386 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:06,390 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:06,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:06,391 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:06,466 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:06,471 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 14:57:06,472 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:465, output treesize:193 [2021-06-05 14:57:06,614 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 82 [2021-06-05 14:57:06,783 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2021-06-05 14:57:07,385 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 14:57:07,385 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165656524] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:07,385 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:57:07,385 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:57:07,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741774238] [2021-06-05 14:57:07,385 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:57:07,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:57:07,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:57:07,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:57:07,385 INFO L87 Difference]: Start difference. First operand 481 states and 1479 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 14:57:07,652 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 99 [2021-06-05 14:57:08,163 WARN L205 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 112 [2021-06-05 14:57:08,301 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2021-06-05 14:57:08,726 WARN L205 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 116 [2021-06-05 14:57:08,921 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-05 14:57:09,365 WARN L205 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 127 [2021-06-05 14:57:09,581 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2021-06-05 14:57:10,054 WARN L205 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 133 [2021-06-05 14:57:10,264 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2021-06-05 14:57:10,784 WARN L205 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 140 [2021-06-05 14:57:10,989 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2021-06-05 14:57:11,480 WARN L205 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 130 [2021-06-05 14:57:11,992 WARN L205 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 136 [2021-06-05 14:57:11,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:57:11,993 INFO L93 Difference]: Finished difference Result 1142 states and 3217 transitions. [2021-06-05 14:57:11,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 14:57:11,993 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 14:57:11,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:57:11,994 INFO L225 Difference]: With dead ends: 1142 [2021-06-05 14:57:11,994 INFO L226 Difference]: Without dead ends: 1106 [2021-06-05 14:57:11,994 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 5253.3ms TimeCoverageRelationStatistics Valid=217, Invalid=839, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 14:57:11,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2021-06-05 14:57:12,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 487. [2021-06-05 14:57:12,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 486 states have (on average 3.0823045267489713) internal successors, (1498), 486 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:57:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1498 transitions. [2021-06-05 14:57:12,001 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1498 transitions. Word has length 20 [2021-06-05 14:57:12,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:57:12,001 INFO L482 AbstractCegarLoop]: Abstraction has 487 states and 1498 transitions. [2021-06-05 14:57:12,001 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 14:57:12,001 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1498 transitions. [2021-06-05 14:57:12,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:57:12,002 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:57:12,002 INFO L521 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 14:57:12,202 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 289 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9775 [2021-06-05 14:57:12,202 INFO L430 AbstractCegarLoop]: === Iteration 480 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:57:12,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:57:12,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1330586956, now seen corresponding path program 88 times [2021-06-05 14:57:12,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:57:12,202 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715608457] [2021-06-05 14:57:12,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:57:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:57:12,703 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 14:57:12,703 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:57:12,703 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715608457] [2021-06-05 14:57:12,703 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715608457] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:12,703 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486051521] [2021-06-05 14:57:12,703 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 14:57:12,729 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:57:12,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:57:12,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:57:12,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:57:12,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 44 treesize of output 32 [2021-06-05 14:57:12,830 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 38 treesize of output 28 [2021-06-05 14:57:12,834 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 29 treesize of output 21 [2021-06-05 14:57:12,838 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 14:57:12,842 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 29 treesize of output 21 [2021-06-05 14:57:12,845 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:57:12,849 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 14:57:12,853 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 38 treesize of output 28 [2021-06-05 14:57:12,857 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 38 treesize of output 28 [2021-06-05 14:57:12,861 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 14:57:12,864 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 14:57:12,868 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 29 treesize of output 21 [2021-06-05 14:57:12,872 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 30 treesize of output 22 [2021-06-05 14:57:12,875 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:57: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 31 treesize of output 23 [2021-06-05 14:57:12,879 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 37 treesize of output 27 [2021-06-05 14:57:12,883 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 30 treesize of output 22 [2021-06-05 14:57:12,887 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:57: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 37 treesize of output 27 [2021-06-05 14:57:12,890 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 44 treesize of output 32 [2021-06-05 14:57:12,894 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:57: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 30 treesize of output 22 [2021-06-05 14:57:12,898 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 14:57:12,901 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 37 treesize of output 27 [2021-06-05 14:57:12,906 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 30 treesize of output 22 [2021-06-05 14:57:12,910 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 43 treesize of output 31 [2021-06-05 14:57:12,914 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 14:57:12,918 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 14:57:12,923 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 36 treesize of output 26 [2021-06-05 14:57:12,927 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 14:57:12,931 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 37 treesize of output 27 [2021-06-05 14:57:12,935 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 45 treesize of output 33 [2021-06-05 14:57:12,939 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 29 treesize of output 21 [2021-06-05 14:57:12,942 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 31 treesize of output 23 [2021-06-05 14:57:12,949 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 37 treesize of output 27 [2021-06-05 14:57:12,953 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 30 treesize of output 22 [2021-06-05 14:57:12,957 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:57:12,960 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 14:57:12,963 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:12,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 31 treesize of output 23 [2021-06-05 14:57:12,967 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:13,083 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2021-06-05 14:57:13,083 INFO L628 ElimStorePlain]: treesize reduction 248, result has 37.5 percent of original size [2021-06-05 14:57:13,085 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:57:13,085 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1549, output treesize:149 [2021-06-05 14:57:13,309 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2021-06-05 14:57:13,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 14:57:13,614 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486051521] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:13,614 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:57:13,614 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:57:13,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858661338] [2021-06-05 14:57:13,614 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:57:13,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:57:13,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:57:13,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:57:13,614 INFO L87 Difference]: Start difference. First operand 487 states and 1498 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 14:57:14,046 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2021-06-05 14:57:14,520 WARN L205 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2021-06-05 14:57:14,962 WARN L205 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 85 [2021-06-05 14:57:15,516 WARN L205 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 98 [2021-06-05 14:57:16,320 WARN L205 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 105 [2021-06-05 14:57:17,054 WARN L205 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 119 [2021-06-05 14:57:17,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:57:17,078 INFO L93 Difference]: Finished difference Result 883 states and 2591 transitions. [2021-06-05 14:57:17,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:57:17,078 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 14:57:17,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:57:17,079 INFO L225 Difference]: With dead ends: 883 [2021-06-05 14:57:17,079 INFO L226 Difference]: Without dead ends: 868 [2021-06-05 14:57:17,079 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 4097.8ms TimeCoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:57:17,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2021-06-05 14:57:17,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 478. [2021-06-05 14:57:17,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 3.090146750524109) internal successors, (1474), 477 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:57:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1474 transitions. [2021-06-05 14:57:17,085 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1474 transitions. Word has length 20 [2021-06-05 14:57:17,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:57:17,085 INFO L482 AbstractCegarLoop]: Abstraction has 478 states and 1474 transitions. [2021-06-05 14:57:17,085 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 14:57:17,085 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1474 transitions. [2021-06-05 14:57:17,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:57:17,086 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:57:17,086 INFO L521 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 14:57:17,286 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 290 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9870 [2021-06-05 14:57:17,286 INFO L430 AbstractCegarLoop]: === Iteration 481 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:57:17,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:57:17,287 INFO L82 PathProgramCache]: Analyzing trace with hash -647803412, now seen corresponding path program 89 times [2021-06-05 14:57:17,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:57:17,287 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285246159] [2021-06-05 14:57:17,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:57:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:57:17,533 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 14:57:17,534 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:57:17,534 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285246159] [2021-06-05 14:57:17,534 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285246159] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:17,534 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914249782] [2021-06-05 14:57:17,534 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 14:57:17,560 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:57:17,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:57:17,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 14:57:17,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:57:17,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:57:17,678 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,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 30 treesize of output 22 [2021-06-05 14:57:17,682 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,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 37 treesize of output 27 [2021-06-05 14:57:17,687 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,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 29 treesize of output 21 [2021-06-05 14:57:17,691 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,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 14:57:17,696 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:57:17,701 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:57:17,705 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:57:17,710 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,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 37 treesize of output 27 [2021-06-05 14:57:17,714 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:57:17,719 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,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 14:57:17,723 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,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 43 treesize of output 31 [2021-06-05 14:57:17,728 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,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 45 treesize of output 33 [2021-06-05 14:57:17,732 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:57:17,737 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,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 44 treesize of output 32 [2021-06-05 14:57:17,742 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:57:17,746 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,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 30 treesize of output 22 [2021-06-05 14:57:17,751 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,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 29 treesize of output 21 [2021-06-05 14:57:17,755 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,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 30 treesize of output 22 [2021-06-05 14:57:17,759 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,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 29 treesize of output 21 [2021-06-05 14:57:17,764 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:57:17,768 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,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 14:57:17,773 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,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 44 treesize of output 32 [2021-06-05 14:57:17,777 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,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 36 treesize of output 26 [2021-06-05 14:57:17,782 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:57:17,786 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,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 30 treesize of output 22 [2021-06-05 14:57:17,790 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:57:17,795 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,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 38 treesize of output 28 [2021-06-05 14:57:17,800 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,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 38 treesize of output 28 [2021-06-05 14:57:17,804 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:57:17,809 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:57:17,813 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,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 31 treesize of output 23 [2021-06-05 14:57:17,817 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,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 30 treesize of output 22 [2021-06-05 14:57:17,822 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,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 14:57:17,827 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:17,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 14:57:17,831 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:57: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 38 treesize of output 28 [2021-06-05 14:57:17,835 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:18,003 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2021-06-05 14:57:18,003 INFO L628 ElimStorePlain]: treesize reduction 347, result has 39.9 percent of original size [2021-06-05 14:57:18,005 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:57:18,005 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1873, output treesize:230 [2021-06-05 14:57:18,538 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2021-06-05 14:57:18,716 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2021-06-05 14:57:18,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 14:57:18,805 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914249782] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:18,805 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:57:18,805 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:57:18,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035984477] [2021-06-05 14:57:18,805 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:57:18,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:57:18,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:57:18,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:57:18,805 INFO L87 Difference]: Start difference. First operand 478 states and 1474 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 14:57:19,151 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2021-06-05 14:57:19,489 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2021-06-05 14:57:19,990 WARN L205 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2021-06-05 14:57:20,172 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2021-06-05 14:57:20,699 WARN L205 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2021-06-05 14:57:20,994 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2021-06-05 14:57:21,313 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 91 [2021-06-05 14:57:21,801 WARN L205 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 100 [2021-06-05 14:57:21,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:57:21,938 INFO L93 Difference]: Finished difference Result 955 states and 2769 transitions. [2021-06-05 14:57:21,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 14:57:21,938 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 14:57:21,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:57:21,939 INFO L225 Difference]: With dead ends: 955 [2021-06-05 14:57:21,940 INFO L226 Difference]: Without dead ends: 913 [2021-06-05 14:57:21,940 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 3742.2ms TimeCoverageRelationStatistics Valid=176, Invalid=880, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 14:57:21,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2021-06-05 14:57:21,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 484. [2021-06-05 14:57:21,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 3.0973084886128364) internal successors, (1496), 483 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:57:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1496 transitions. [2021-06-05 14:57:21,946 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1496 transitions. Word has length 20 [2021-06-05 14:57:21,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:57:21,946 INFO L482 AbstractCegarLoop]: Abstraction has 484 states and 1496 transitions. [2021-06-05 14:57:21,946 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 14:57:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1496 transitions. [2021-06-05 14:57:21,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:57:21,946 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:57:21,946 INFO L521 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 14:57:22,147 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9894,291 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:57:22,147 INFO L430 AbstractCegarLoop]: === Iteration 482 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:57:22,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:57:22,147 INFO L82 PathProgramCache]: Analyzing trace with hash -854811094, now seen corresponding path program 90 times [2021-06-05 14:57:22,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:57:22,147 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969301959] [2021-06-05 14:57:22,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:57:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:57:22,472 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 14:57:22,473 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:57:22,473 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969301959] [2021-06-05 14:57:22,473 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969301959] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:22,473 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890447829] [2021-06-05 14:57:22,473 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 292 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 292 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:57:22,499 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:57:22,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:57:22,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:57:22,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:57:22,732 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:22,732 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:22,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:22,733 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:22,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:22,741 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:22,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 22 treesize of output 16 [2021-06-05 14:57:22,742 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:22,745 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:22,746 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:22,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 23 treesize of output 17 [2021-06-05 14:57:22,747 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:22,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:22,751 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:22,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:22,752 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:22,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:22,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:22,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 22 treesize of output 16 [2021-06-05 14:57:22,756 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:22,759 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:22,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 29 treesize of output 21 [2021-06-05 14:57:22,760 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:22,978 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2021-06-05 14:57:22,978 INFO L628 ElimStorePlain]: treesize reduction 361, result has 44.5 percent of original size [2021-06-05 14:57:22,981 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:22,982 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:22,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 15 treesize of output 11 [2021-06-05 14:57:22,983 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:22,985 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:22,986 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:22,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:22,987 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:22,990 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:22,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 15 treesize of output 11 [2021-06-05 14:57:22,990 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:23,158 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2021-06-05 14:57:23,158 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 14:57:23,162 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:23,162 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:23,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:23,163 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:23,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:23,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:23,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 14:57:23,167 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:23,170 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:23,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:23,171 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:23,311 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2021-06-05 14:57:23,311 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.5 percent of original size [2021-06-05 14:57:23,317 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 14:57:23,317 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:751, output treesize:191 [2021-06-05 14:57:23,760 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2021-06-05 14:57:24,081 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2021-06-05 14:57:24,235 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 14:57:24,235 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890447829] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:24,235 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:57:24,235 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:57:24,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154389367] [2021-06-05 14:57:24,236 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:57:24,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:57:24,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:57:24,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:57:24,236 INFO L87 Difference]: Start difference. First operand 484 states and 1496 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 14:57:24,901 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 121 [2021-06-05 14:57:25,480 WARN L205 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 125 [2021-06-05 14:57:26,224 WARN L205 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 136 [2021-06-05 14:57:26,894 WARN L205 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 141 [2021-06-05 14:57:27,588 WARN L205 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 150 [2021-06-05 14:57:28,369 WARN L205 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 159 [2021-06-05 14:57:28,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:57:28,388 INFO L93 Difference]: Finished difference Result 857 states and 2484 transitions. [2021-06-05 14:57:28,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:57:28,388 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 14:57:28,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:57:28,389 INFO L225 Difference]: With dead ends: 857 [2021-06-05 14:57:28,389 INFO L226 Difference]: Without dead ends: 836 [2021-06-05 14:57:28,389 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 4704.1ms TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:57:28,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2021-06-05 14:57:28,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 486. [2021-06-05 14:57:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 3.0989690721649485) internal successors, (1503), 485 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:57:28,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1503 transitions. [2021-06-05 14:57:28,395 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1503 transitions. Word has length 20 [2021-06-05 14:57:28,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:57:28,395 INFO L482 AbstractCegarLoop]: Abstraction has 486 states and 1503 transitions. [2021-06-05 14:57:28,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 14:57:28,395 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1503 transitions. [2021-06-05 14:57:28,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:57:28,396 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:57:28,396 INFO L521 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 14:57:28,596 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 292 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9932 [2021-06-05 14:57:28,596 INFO L430 AbstractCegarLoop]: === Iteration 483 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:57:28,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:57:28,596 INFO L82 PathProgramCache]: Analyzing trace with hash -2073446454, now seen corresponding path program 91 times [2021-06-05 14:57:28,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:57:28,597 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867444177] [2021-06-05 14:57:28,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:57:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:57:29,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 14:57:29,014 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:57:29,014 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867444177] [2021-06-05 14:57:29,014 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867444177] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:29,014 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579691374] [2021-06-05 14:57:29,014 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 293 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 293 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:57:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:57:29,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:57:29,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:57:29,283 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:29,283 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:29,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:29,285 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,288 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:29,289 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:29,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:29,290 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,294 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:29,294 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:29,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 29 treesize of output 21 [2021-06-05 14:57:29,295 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,298 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:29,299 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:29,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 14:57:29,300 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,303 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:29,304 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:29,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 22 treesize of output 16 [2021-06-05 14:57:29,304 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:29,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:29,309 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,525 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2021-06-05 14:57:29,526 INFO L628 ElimStorePlain]: treesize reduction 314, result has 47.9 percent of original size [2021-06-05 14:57:29,529 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:29,529 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:29,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 30 treesize of output 22 [2021-06-05 14:57:29,531 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,533 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:29,534 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:29,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 14:57:29,535 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,537 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:29,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 14:57:29,539 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,683 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2021-06-05 14:57:29,683 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.6 percent of original size [2021-06-05 14:57:29,686 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:29,686 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:29,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:29,687 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,690 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:29,690 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:29,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 22 treesize of output 16 [2021-06-05 14:57:29,691 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,694 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:29,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 23 treesize of output 17 [2021-06-05 14:57:29,694 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:29,762 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:29,767 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 14:57:29,768 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:751, output treesize:190 [2021-06-05 14:57:30,201 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2021-06-05 14:57:30,521 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2021-06-05 14:57:30,679 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 14:57:30,679 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579691374] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:30,679 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:57:30,679 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:57:30,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822850262] [2021-06-05 14:57:30,680 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:57:30,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:57:30,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:57:30,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:57:30,680 INFO L87 Difference]: Start difference. First operand 486 states and 1503 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 14:57:31,196 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 110 [2021-06-05 14:57:31,710 WARN L205 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 113 [2021-06-05 14:57:32,379 WARN L205 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 124 [2021-06-05 14:57:32,814 WARN L205 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 128 [2021-06-05 14:57:33,283 WARN L205 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 139 [2021-06-05 14:57:33,840 WARN L205 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 150 [2021-06-05 14:57:34,327 WARN L205 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 153 [2021-06-05 14:57:34,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:57:34,336 INFO L93 Difference]: Finished difference Result 834 states and 2443 transitions. [2021-06-05 14:57:34,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:57:34,337 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 14:57:34,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:57:34,338 INFO L225 Difference]: With dead ends: 834 [2021-06-05 14:57:34,338 INFO L226 Difference]: Without dead ends: 819 [2021-06-05 14:57:34,338 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 4349.4ms TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:57:34,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2021-06-05 14:57:34,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 484. [2021-06-05 14:57:34,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 3.0973084886128364) internal successors, (1496), 483 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:57:34,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1496 transitions. [2021-06-05 14:57:34,344 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1496 transitions. Word has length 20 [2021-06-05 14:57:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:57:34,344 INFO L482 AbstractCegarLoop]: Abstraction has 484 states and 1496 transitions. [2021-06-05 14:57:34,344 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 14:57:34,344 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1496 transitions. [2021-06-05 14:57:34,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:57:34,344 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:57:34,344 INFO L521 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 14:57:34,545 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10010,293 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:57:34,545 INFO L430 AbstractCegarLoop]: === Iteration 484 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:57:34,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:57:34,545 INFO L82 PathProgramCache]: Analyzing trace with hash -51697496, now seen corresponding path program 92 times [2021-06-05 14:57:34,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:57:34,545 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953018345] [2021-06-05 14:57:34,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:57:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:57:35,028 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 14:57:35,028 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:57:35,028 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953018345] [2021-06-05 14:57:35,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953018345] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:35,028 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196243960] [2021-06-05 14:57:35,028 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 294 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 294 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:57:35,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:57:35,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:57:35,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 14:57:35,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:57:35,518 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:35,518 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:35,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 30 treesize of output 22 [2021-06-05 14:57:35,520 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,524 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:35,524 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:35,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:35,525 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,529 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:35,530 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:35,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 22 treesize of output 16 [2021-06-05 14:57:35,531 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,535 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:35,535 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:35,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 22 treesize of output 16 [2021-06-05 14:57:35,536 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,540 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:35,541 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:35,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 23 treesize of output 17 [2021-06-05 14:57:35,542 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,546 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:35,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:35,546 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,878 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2021-06-05 14:57:35,878 INFO L628 ElimStorePlain]: treesize reduction 403, result has 48.1 percent of original size [2021-06-05 14:57:35,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:35,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:35,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 14:57:35,884 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:35,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:35,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:35,890 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:35,893 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:35,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 23 treesize of output 17 [2021-06-05 14:57:35,894 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:36,153 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2021-06-05 14:57:36,154 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.7 percent of original size [2021-06-05 14:57:36,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:36,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:36,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 14:57:36,159 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:36,163 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:36,163 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:36,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 14:57:36,164 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:36,168 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:36,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 14:57:36,169 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:36,291 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-06-05 14:57:36,291 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:36,298 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 14:57:36,298 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:949, output treesize:296 [2021-06-05 14:57:36,505 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 109 [2021-06-05 14:57:36,674 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-06-05 14:57:37,244 WARN L205 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 139 [2021-06-05 14:57:37,565 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 116 [2021-06-05 14:57:37,936 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1901, v_prenex_1903, v_prenex_1891, get_6, v_prenex_1893, v_prenex_1895, v_prenex_1897, v_prenex_1899], 1=[v_prenex_1900, v_prenex_1902, v_prenex_1904, v_prenex_1892, v_prenex_1894, get_0, v_prenex_1896, v_prenex_1898]} [2021-06-05 14:57:37,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 14:57:37,948 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:37,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:57:37,960 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:37,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:57:37,971 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:37,982 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:37,983 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:37,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 23 treesize of output 17 [2021-06-05 14:57:37,994 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:38,005 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:57:38,006 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:38,620 WARN L205 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 122 [2021-06-05 14:57:38,620 INFO L628 ElimStorePlain]: treesize reduction 2099, result has 15.7 percent of original size [2021-06-05 14:57:38,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 7 treesize of output 5 [2021-06-05 14:57:38,628 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:38,781 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-06-05 14:57:38,781 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:38,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 14:57:38,788 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:38,927 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-06-05 14:57:38,928 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:38,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 7 treesize of output 5 [2021-06-05 14:57:38,934 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:39,078 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-06-05 14:57:39,078 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:39,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:57:39,084 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:39,216 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-05 14:57:39,216 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:39,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:57:39,223 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:39,353 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-06-05 14:57:39,353 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:39,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:57:39,359 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:39,483 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 14:57:39,484 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:39,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 7 treesize of output 5 [2021-06-05 14:57:39,489 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:39,613 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-05 14:57:39,614 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:39,614 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1900 vanished before elimination [2021-06-05 14:57:39,614 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1902 vanished before elimination [2021-06-05 14:57:39,614 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1904 vanished before elimination [2021-06-05 14:57:39,614 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1892 vanished before elimination [2021-06-05 14:57:39,614 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1894 vanished before elimination [2021-06-05 14:57:39,614 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 14:57:39,614 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1896 vanished before elimination [2021-06-05 14:57:39,614 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1898 vanished before elimination [2021-06-05 14:57:39,618 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 16 dim-1 vars, End of recursive call: and 14 xjuncts. [2021-06-05 14:57:39,619 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 24 variables, input treesize:2641, output treesize:276 [2021-06-05 14:57:39,822 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2021-06-05 14:57:39,950 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 14:57:39,950 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196243960] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:39,950 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:57:39,950 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:57:39,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552328833] [2021-06-05 14:57:39,950 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:57:39,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:57:39,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:57:39,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:57:39,951 INFO L87 Difference]: Start difference. First operand 484 states and 1496 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 14:57:40,649 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 154 [2021-06-05 14:57:41,299 WARN L205 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 130 [2021-06-05 14:57:42,184 WARN L205 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 267 DAG size of output: 227 [2021-06-05 14:57:43,238 WARN L205 SmtUtils]: Spent 928.00 ms on a formula simplification. DAG size of input: 292 DAG size of output: 232 [2021-06-05 14:57:43,479 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2021-06-05 14:57:44,066 WARN L205 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 177 [2021-06-05 14:57:44,300 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2021-06-05 14:57:44,942 WARN L205 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 186 [2021-06-05 14:57:44,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:57:44,972 INFO L93 Difference]: Finished difference Result 827 states and 2453 transitions. [2021-06-05 14:57:44,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:57:44,972 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 14:57:44,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:57:44,973 INFO L225 Difference]: With dead ends: 827 [2021-06-05 14:57:44,973 INFO L226 Difference]: Without dead ends: 800 [2021-06-05 14:57:44,973 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 6298.8ms TimeCoverageRelationStatistics Valid=138, Invalid=674, Unknown=0, NotChecked=0, Total=812 [2021-06-05 14:57:44,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2021-06-05 14:57:44,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 487. [2021-06-05 14:57:44,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 486 states have (on average 3.094650205761317) internal successors, (1504), 486 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:57:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1504 transitions. [2021-06-05 14:57:44,979 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1504 transitions. Word has length 20 [2021-06-05 14:57:44,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:57:44,979 INFO L482 AbstractCegarLoop]: Abstraction has 487 states and 1504 transitions. [2021-06-05 14:57:44,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 14:57:44,979 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1504 transitions. [2021-06-05 14:57:44,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:57:44,980 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:57:44,980 INFO L521 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 14:57:45,195 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 294 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10089 [2021-06-05 14:57:45,196 INFO L430 AbstractCegarLoop]: === Iteration 485 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:57:45,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:57:45,196 INFO L82 PathProgramCache]: Analyzing trace with hash -367808852, now seen corresponding path program 93 times [2021-06-05 14:57:45,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:57:45,196 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869364126] [2021-06-05 14:57:45,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:57:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:57:45,610 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 14:57:45,610 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:57:45,610 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869364126] [2021-06-05 14:57:45,610 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869364126] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:45,610 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543085337] [2021-06-05 14:57:45,610 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 295 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 295 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:57:45,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:57:45,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:57:45,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:57:45,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:57:45,899 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:45,899 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:45,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:45,900 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:45,904 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:45,905 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:45,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:45,906 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:45,909 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:45,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:45,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 38 treesize of output 28 [2021-06-05 14:57:45,911 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:45,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:45,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:45,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 30 treesize of output 22 [2021-06-05 14:57:45,916 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:45,920 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:45,920 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:45,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:45,921 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:45,925 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:45,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:45,926 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:46,127 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2021-06-05 14:57:46,128 INFO L628 ElimStorePlain]: treesize reduction 308, result has 45.7 percent of original size [2021-06-05 14:57:46,131 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:46,131 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:46,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:46,132 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:46,135 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:46,136 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:46,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 15 treesize of output 11 [2021-06-05 14:57:46,136 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:46,139 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:46,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 14:57:46,140 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:46,222 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:46,225 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:46,226 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:46,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:46,227 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:46,230 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:46,230 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:46,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:46,231 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:46,234 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:46,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:46,235 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:46,375 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2021-06-05 14:57:46,376 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.5 percent of original size [2021-06-05 14:57:46,381 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 14:57:46,381 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:751, output treesize:191 [2021-06-05 14:57:47,095 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2021-06-05 14:57:47,259 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 14:57:47,259 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543085337] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:47,259 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:57:47,259 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:57:47,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283177700] [2021-06-05 14:57:47,259 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:57:47,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:57:47,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:57:47,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:57:47,260 INFO L87 Difference]: Start difference. First operand 487 states and 1504 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 14:57:47,810 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 118 [2021-06-05 14:57:48,450 WARN L205 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 120 [2021-06-05 14:57:49,308 WARN L205 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 139 [2021-06-05 14:57:49,791 WARN L205 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 139 [2021-06-05 14:57:50,238 WARN L205 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 144 [2021-06-05 14:57:50,993 WARN L205 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 153 [2021-06-05 14:57:51,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:57:51,011 INFO L93 Difference]: Finished difference Result 835 states and 2452 transitions. [2021-06-05 14:57:51,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:57:51,011 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 14:57:51,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:57:51,013 INFO L225 Difference]: With dead ends: 835 [2021-06-05 14:57:51,013 INFO L226 Difference]: Without dead ends: 814 [2021-06-05 14:57:51,013 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 4338.3ms TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:57:51,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2021-06-05 14:57:51,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 490. [2021-06-05 14:57:51,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 3.0920245398773005) internal successors, (1512), 489 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:57:51,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1512 transitions. [2021-06-05 14:57:51,019 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1512 transitions. Word has length 20 [2021-06-05 14:57:51,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:57:51,019 INFO L482 AbstractCegarLoop]: Abstraction has 490 states and 1512 transitions. [2021-06-05 14:57:51,019 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 14:57:51,019 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1512 transitions. [2021-06-05 14:57:51,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:57:51,019 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:57:51,019 INFO L521 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 14:57:51,220 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10243,295 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:57:51,220 INFO L430 AbstractCegarLoop]: === Iteration 486 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:57:51,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:57:51,220 INFO L82 PathProgramCache]: Analyzing trace with hash -2066529240, now seen corresponding path program 94 times [2021-06-05 14:57:51,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:57:51,220 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066199753] [2021-06-05 14:57:51,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:57:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:57:51,507 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 14:57:51,507 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:57:51,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066199753] [2021-06-05 14:57:51,507 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066199753] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:51,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075416079] [2021-06-05 14:57:51,507 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 296 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 296 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:57:51,534 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:57:51,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:57:51,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:57:51,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:57:51,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:51,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:51,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:51,950 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:51,955 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:51,955 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:51,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 30 treesize of output 22 [2021-06-05 14:57:51,956 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:51,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:51,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:51,962 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:52,238 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2021-06-05 14:57:52,238 INFO L628 ElimStorePlain]: treesize reduction 158, result has 68.9 percent of original size [2021-06-05 14:57:52,243 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:52,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:52,244 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:52,375 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-06-05 14:57:52,375 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:52,380 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:52,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:52,381 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:52,510 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-06-05 14:57:52,510 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:52,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:52,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:52,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:52,516 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:52,520 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:52,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 23 treesize of output 17 [2021-06-05 14:57:52,521 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:52,634 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-05 14:57:52,634 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:52,638 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:52,639 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:52,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:52,640 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:52,644 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:52,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:57:52,644 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:52,748 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-06-05 14:57:52,748 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:52,752 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:57:52,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 15 treesize of output 11 [2021-06-05 14:57:52,753 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:52,855 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-06-05 14:57:52,855 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:52,861 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 14:57:52,861 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:537, output treesize:247 [2021-06-05 14:57:53,052 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2021-06-05 14:57:53,488 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2021-06-05 14:57:53,793 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1945, v_prenex_1947, v_prenex_1949, get_6, v_prenex_1941, v_prenex_1951, v_prenex_1943], 1=[v_prenex_1944, v_prenex_1946, v_prenex_1948, v_prenex_1950, get_0, v_prenex_1952, v_prenex_1942]} [2021-06-05 14:57:53,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 32 treesize of output 24 [2021-06-05 14:57:53,804 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:53,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 25 treesize of output 19 [2021-06-05 14:57:53,813 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:53,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 24 treesize of output 18 [2021-06-05 14:57:53,823 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:53,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 24 treesize of output 18 [2021-06-05 14:57:53,834 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:53,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 25 treesize of output 19 [2021-06-05 14:57:53,843 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:53,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:57:53,854 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:54,372 WARN L205 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 104 [2021-06-05 14:57:54,372 INFO L628 ElimStorePlain]: treesize reduction 1756, result has 16.8 percent of original size [2021-06-05 14:57:54,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 7 treesize of output 5 [2021-06-05 14:57:54,378 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:54,507 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-06-05 14:57:54,507 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:54,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 16 treesize of output 12 [2021-06-05 14:57:54,513 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:54,637 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-06-05 14:57:54,638 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:54,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:57:54,644 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:54,769 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-06-05 14:57:54,769 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:54,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:57:54,775 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:54,896 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-06-05 14:57:54,896 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:54,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 7 treesize of output 5 [2021-06-05 14:57:54,901 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:55,021 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2021-06-05 14:57:55,022 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:55,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 16 treesize of output 12 [2021-06-05 14:57:55,026 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:57:55,142 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-06-05 14:57:55,143 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:57:55,143 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1944 vanished before elimination [2021-06-05 14:57:55,143 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1946 vanished before elimination [2021-06-05 14:57:55,143 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1948 vanished before elimination [2021-06-05 14:57:55,143 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1950 vanished before elimination [2021-06-05 14:57:55,143 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 14:57:55,143 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1952 vanished before elimination [2021-06-05 14:57:55,143 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1942 vanished before elimination [2021-06-05 14:57:55,147 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 14:57:55,147 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 21 variables, input treesize:2293, output treesize:253 [2021-06-05 14:57:55,454 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2021-06-05 14:57:55,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 14:57:55,608 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075416079] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:57:55,608 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:57:55,608 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:57:55,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521139371] [2021-06-05 14:57:55,608 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:57:55,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:57:55,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:57:55,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:57:55,608 INFO L87 Difference]: Start difference. First operand 490 states and 1512 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 14:57:56,245 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 123 [2021-06-05 14:57:56,728 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 125 [2021-06-05 14:57:57,596 WARN L205 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 141 [2021-06-05 14:57:58,294 WARN L205 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 145 [2021-06-05 14:57:59,104 WARN L205 SmtUtils]: Spent 739.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 155 [2021-06-05 14:58:00,002 WARN L205 SmtUtils]: Spent 837.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 166 [2021-06-05 14:58:00,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:58:00,034 INFO L93 Difference]: Finished difference Result 812 states and 2410 transitions. [2021-06-05 14:58:00,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:58:00,034 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 14:58:00,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:58:00,035 INFO L225 Difference]: With dead ends: 812 [2021-06-05 14:58:00,035 INFO L226 Difference]: Without dead ends: 797 [2021-06-05 14:58:00,035 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 5196.9ms TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:58:00,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2021-06-05 14:58:00,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 484. [2021-06-05 14:58:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 3.0973084886128364) internal successors, (1496), 483 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:58:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1496 transitions. [2021-06-05 14:58:00,041 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1496 transitions. Word has length 20 [2021-06-05 14:58:00,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:58:00,041 INFO L482 AbstractCegarLoop]: Abstraction has 484 states and 1496 transitions. [2021-06-05 14:58:00,041 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 14:58:00,041 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1496 transitions. [2021-06-05 14:58:00,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:58:00,042 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:58:00,042 INFO L521 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 14:58:00,242 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 296 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10322 [2021-06-05 14:58:00,242 INFO L430 AbstractCegarLoop]: === Iteration 487 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:58:00,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:58:00,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1043679718, now seen corresponding path program 95 times [2021-06-05 14:58:00,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:58:00,243 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001736908] [2021-06-05 14:58:00,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:58:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:58:00,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 14:58:00,541 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:58:00,541 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001736908] [2021-06-05 14:58:00,541 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001736908] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:58:00,541 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412764284] [2021-06-05 14:58:00,541 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 297 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 297 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:58:00,567 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:58:00,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:58:00,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:58:00,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:58:00,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:00,681 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:00,685 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:00,689 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,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 37 treesize of output 27 [2021-06-05 14:58:00,692 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,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 36 treesize of output 26 [2021-06-05 14:58:00,696 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:00,700 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:58: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 30 treesize of output 22 [2021-06-05 14:58:00,704 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,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 36 treesize of output 26 [2021-06-05 14:58:00,708 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,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 29 treesize of output 21 [2021-06-05 14:58:00,711 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,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 31 treesize of output 23 [2021-06-05 14:58:00,715 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:00,719 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,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 38 treesize of output 28 [2021-06-05 14:58:00,723 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:00,727 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:00,731 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:00,735 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,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 37 treesize of output 27 [2021-06-05 14:58:00,739 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,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 37 treesize of output 27 [2021-06-05 14:58:00,743 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:00,746 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,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 30 treesize of output 22 [2021-06-05 14:58:00,750 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:00,754 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:00,758 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,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 14:58:00,762 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:00,766 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,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 30 treesize of output 22 [2021-06-05 14:58:00,769 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,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 30 treesize of output 22 [2021-06-05 14:58:00,773 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:00,777 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:00,781 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:00,785 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:00,789 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,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 14:58:00,792 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,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 45 treesize of output 33 [2021-06-05 14:58:00,796 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,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 37 treesize of output 27 [2021-06-05 14:58:00,800 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,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 29 treesize of output 21 [2021-06-05 14:58:00,803 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:00,807 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,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 37 treesize of output 27 [2021-06-05 14:58:00,810 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,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 14:58:00,813 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:00,927 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2021-06-05 14:58:00,927 INFO L628 ElimStorePlain]: treesize reduction 268, result has 35.7 percent of original size [2021-06-05 14:58:00,929 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:58:00,929 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1549, output treesize:149 [2021-06-05 14:58:01,387 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 14:58:01,387 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412764284] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:58:01,387 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:58:01,387 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:58:01,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255267887] [2021-06-05 14:58:01,387 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:58:01,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:58:01,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:58:01,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:58:01,388 INFO L87 Difference]: Start difference. First operand 484 states and 1496 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 14:58:01,853 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2021-06-05 14:58:02,371 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 80 [2021-06-05 14:58:02,575 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2021-06-05 14:58:03,018 WARN L205 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 96 [2021-06-05 14:58:03,576 WARN L205 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 104 [2021-06-05 14:58:04,228 WARN L205 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 112 [2021-06-05 14:58:04,436 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2021-06-05 14:58:05,119 WARN L205 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 119 [2021-06-05 14:58:05,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:58:05,158 INFO L93 Difference]: Finished difference Result 980 states and 2882 transitions. [2021-06-05 14:58:05,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 14:58:05,158 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 14:58:05,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:58:05,159 INFO L225 Difference]: With dead ends: 980 [2021-06-05 14:58:05,159 INFO L226 Difference]: Without dead ends: 959 [2021-06-05 14:58:05,159 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 3932.5ms TimeCoverageRelationStatistics Valid=157, Invalid=773, Unknown=0, NotChecked=0, Total=930 [2021-06-05 14:58:05,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2021-06-05 14:58:05,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 487. [2021-06-05 14:58:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 486 states have (on average 3.1049382716049383) internal successors, (1509), 486 states have internal predecessors, (1509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:58:05,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1509 transitions. [2021-06-05 14:58:05,166 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1509 transitions. Word has length 20 [2021-06-05 14:58:05,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:58:05,166 INFO L482 AbstractCegarLoop]: Abstraction has 487 states and 1509 transitions. [2021-06-05 14:58:05,166 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 14:58:05,166 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1509 transitions. [2021-06-05 14:58:05,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:58:05,167 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:58:05,167 INFO L521 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 14:58:05,367 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 297 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10457 [2021-06-05 14:58:05,367 INFO L430 AbstractCegarLoop]: === Iteration 488 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:58:05,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:58:05,367 INFO L82 PathProgramCache]: Analyzing trace with hash -174955642, now seen corresponding path program 96 times [2021-06-05 14:58:05,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:58:05,367 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304189306] [2021-06-05 14:58:05,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:58:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:58:05,600 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 14:58:05,600 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:58:05,600 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304189306] [2021-06-05 14:58:05,600 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304189306] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:58:05,600 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307724460] [2021-06-05 14:58:05,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 298 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 298 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:58:05,627 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:58:05,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:58:05,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:58:05,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:58:05,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 14:58:05,732 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 44 treesize of output 32 [2021-06-05 14:58:05,736 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 36 treesize of output 26 [2021-06-05 14:58:05,740 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 36 treesize of output 26 [2021-06-05 14:58:05,743 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:05,747 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 31 treesize of output 23 [2021-06-05 14:58:05,751 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 31 treesize of output 23 [2021-06-05 14:58:05,755 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 14:58:05,759 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 36 treesize of output 26 [2021-06-05 14:58:05,762 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:05,766 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 30 treesize of output 22 [2021-06-05 14:58:05,770 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 38 treesize of output 28 [2021-06-05 14:58:05,774 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 29 treesize of output 21 [2021-06-05 14:58:05,778 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 30 treesize of output 22 [2021-06-05 14:58:05,782 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:05,795 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:05,799 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 37 treesize of output 27 [2021-06-05 14:58:05,803 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 44 treesize of output 32 [2021-06-05 14:58:05,808 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 38 treesize of output 28 [2021-06-05 14:58:05,812 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:05,816 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 37 treesize of output 27 [2021-06-05 14:58:05,820 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:05,825 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:05,828 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 43 treesize of output 31 [2021-06-05 14:58:05,832 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 37 treesize of output 27 [2021-06-05 14:58:05,836 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 30 treesize of output 22 [2021-06-05 14:58:05,840 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 37 treesize of output 27 [2021-06-05 14:58:05,844 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 14:58:05,848 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 14:58:05,851 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 45 treesize of output 33 [2021-06-05 14:58:05,855 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 37 treesize of output 27 [2021-06-05 14:58:05,859 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 29 treesize of output 21 [2021-06-05 14:58:05,862 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 36 treesize of output 26 [2021-06-05 14:58:05,866 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:05,869 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 30 treesize of output 22 [2021-06-05 14:58:05,872 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,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 30 treesize of output 22 [2021-06-05 14:58:05,875 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:05,988 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2021-06-05 14:58:05,988 INFO L628 ElimStorePlain]: treesize reduction 258, result has 36.6 percent of original size [2021-06-05 14:58:05,989 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:58:05,989 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1549, output treesize:149 [2021-06-05 14:58:06,462 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 14:58:06,462 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307724460] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:58:06,462 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:58:06,463 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:58:06,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256418732] [2021-06-05 14:58:06,463 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:58:06,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:58:06,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:58:06,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:58:06,463 INFO L87 Difference]: Start difference. First operand 487 states and 1509 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 14:58:06,889 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2021-06-05 14:58:07,185 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2021-06-05 14:58:07,596 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2021-06-05 14:58:08,036 WARN L205 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 88 [2021-06-05 14:58:08,750 WARN L205 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 95 [2021-06-05 14:58:09,576 WARN L205 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 108 [2021-06-05 14:58:09,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:58:09,597 INFO L93 Difference]: Finished difference Result 904 states and 2607 transitions. [2021-06-05 14:58:09,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:58:09,597 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 14:58:09,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:58:09,598 INFO L225 Difference]: With dead ends: 904 [2021-06-05 14:58:09,598 INFO L226 Difference]: Without dead ends: 889 [2021-06-05 14:58:09,598 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 3366.7ms TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:58:09,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2021-06-05 14:58:09,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 485. [2021-06-05 14:58:09,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 3.103305785123967) internal successors, (1502), 484 states have internal predecessors, (1502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:58:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1502 transitions. [2021-06-05 14:58:09,605 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 1502 transitions. Word has length 20 [2021-06-05 14:58:09,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:58:09,605 INFO L482 AbstractCegarLoop]: Abstraction has 485 states and 1502 transitions. [2021-06-05 14:58:09,605 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 14:58:09,605 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 1502 transitions. [2021-06-05 14:58:09,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:58:09,606 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:58:09,606 INFO L521 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 14:58:09,806 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 298 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10485 [2021-06-05 14:58:09,806 INFO L430 AbstractCegarLoop]: === Iteration 489 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:58:09,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:58:09,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2032740266, now seen corresponding path program 97 times [2021-06-05 14:58:09,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:58:09,806 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361567810] [2021-06-05 14:58:09,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:58:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:58:10,191 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 14:58:10,192 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:58:10,192 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361567810] [2021-06-05 14:58:10,192 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361567810] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:58:10,192 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252741907] [2021-06-05 14:58:10,192 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 299 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 299 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:58:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:58:10,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:58:10,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:58:10,444 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:10,445 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:10,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:10,446 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:10,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:10,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:10,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 23 treesize of output 17 [2021-06-05 14:58:10,451 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:10,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:10,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:10,457 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:10,654 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2021-06-05 14:58:10,655 INFO L628 ElimStorePlain]: treesize reduction 104, result has 73.1 percent of original size [2021-06-05 14:58:10,658 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:10,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:10,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:10,660 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:10,663 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:10,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:10,664 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:10,751 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:10,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:10,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:10,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:10,756 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:10,760 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:10,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 31 treesize of output 23 [2021-06-05 14:58:10,761 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:10,837 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:10,840 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:10,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 15 treesize of output 11 [2021-06-05 14:58:10,841 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:10,915 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:10,918 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:10,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:10,919 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:10,992 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:10,996 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:10,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:10,997 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:11,068 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:11,073 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 14:58:11,073 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:465, output treesize:193 [2021-06-05 14:58:11,217 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 82 [2021-06-05 14:58:11,659 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2021-06-05 14:58:11,818 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2021-06-05 14:58:11,945 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 14:58:11,945 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252741907] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:58:11,946 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:58:11,946 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:58:11,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453896366] [2021-06-05 14:58:11,946 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:58:11,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:58:11,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:58:11,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:58:11,946 INFO L87 Difference]: Start difference. First operand 485 states and 1502 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 14:58:12,482 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 113 [2021-06-05 14:58:12,886 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 117 [2021-06-05 14:58:13,308 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 127 [2021-06-05 14:58:13,950 WARN L205 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 136 [2021-06-05 14:58:14,645 WARN L205 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 142 [2021-06-05 14:58:15,448 WARN L205 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 151 [2021-06-05 14:58:15,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:58:15,466 INFO L93 Difference]: Finished difference Result 905 states and 2610 transitions. [2021-06-05 14:58:15,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:58:15,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 14:58:15,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:58:15,467 INFO L225 Difference]: With dead ends: 905 [2021-06-05 14:58:15,467 INFO L226 Difference]: Without dead ends: 884 [2021-06-05 14:58:15,468 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 4118.8ms TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:58:15,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2021-06-05 14:58:15,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 488. [2021-06-05 14:58:15,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 3.106776180698152) internal successors, (1513), 487 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:58:15,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 1513 transitions. [2021-06-05 14:58:15,474 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 1513 transitions. Word has length 20 [2021-06-05 14:58:15,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:58:15,474 INFO L482 AbstractCegarLoop]: Abstraction has 488 states and 1513 transitions. [2021-06-05 14:58:15,474 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 14:58:15,474 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1513 transitions. [2021-06-05 14:58:15,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:58:15,475 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:58:15,475 INFO L521 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 14:58:15,675 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10512,299 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:58:15,675 INFO L430 AbstractCegarLoop]: === Iteration 490 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:58:15,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:58:15,675 INFO L82 PathProgramCache]: Analyzing trace with hash 862551270, now seen corresponding path program 98 times [2021-06-05 14:58:15,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:58:15,675 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151876315] [2021-06-05 14:58:15,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:58:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:58:16,260 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 14:58:16,260 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:58:16,260 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151876315] [2021-06-05 14:58:16,260 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151876315] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:58:16,260 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244053413] [2021-06-05 14:58:16,261 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 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:58:16,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:58:16,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:58:16,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:58:16,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:58:16,739 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:16,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 23 treesize of output 17 [2021-06-05 14:58:16,740 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:17,026 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 105 [2021-06-05 14:58:17,026 INFO L628 ElimStorePlain]: treesize reduction 179, result has 67.7 percent of original size [2021-06-05 14:58:17,031 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:17,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 14:58:17,032 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:17,162 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2021-06-05 14:58:17,162 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:17,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:17,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 15 treesize of output 11 [2021-06-05 14:58:17,167 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:17,296 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-06-05 14:58:17,296 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:17,301 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:17,301 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:17,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:17,302 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:17,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:17,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 14:58:17,307 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:17,426 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-06-05 14:58:17,426 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:17,431 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:17,431 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:17,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:17,432 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:17,436 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:17,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 31 treesize of output 23 [2021-06-05 14:58:17,437 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:17,542 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-05 14:58:17,542 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:17,546 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:17,547 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:17,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:17,548 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:17,551 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:17,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:17,552 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:17,653 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-06-05 14:58:17,654 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:17,659 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 14:58:17,660 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:561, output treesize:261 [2021-06-05 14:58:17,849 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 100 [2021-06-05 14:58:18,211 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_2011, v_prenex_2001, get_6, v_prenex_1991, v_prenex_2005, v_prenex_2013, v_prenex_1993, v_prenex_2003, v_prenex_2019, v_prenex_2009, v_prenex_1995, v_prenex_2007, v_prenex_1997, v_prenex_1999], 1=[v_prenex_2000, v_prenex_2012, v_prenex_2020, v_prenex_2010, v_prenex_1992, v_prenex_2004, v_prenex_2002, v_prenex_1994, v_prenex_2014, v_prenex_1996, v_prenex_2008, get_0, v_prenex_2006, v_prenex_1998]} [2021-06-05 14:58:18,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:18,223 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:18,706 WARN L205 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 115 [2021-06-05 14:58:18,707 INFO L628 ElimStorePlain]: treesize reduction 1141, result has 24.9 percent of original size [2021-06-05 14:58:18,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 16 treesize of output 12 [2021-06-05 14:58:18,712 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:18,847 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-06-05 14:58:18,848 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:18,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:18,854 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:18,989 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-06-05 14:58:18,990 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:18,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 9 treesize of output 7 [2021-06-05 14:58:18,995 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:19,126 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-06-05 14:58:19,126 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:19,127 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2005 vanished before elimination [2021-06-05 14:58:19,127 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2013 vanished before elimination [2021-06-05 14:58:19,127 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1993 vanished before elimination [2021-06-05 14:58:19,127 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2003 vanished before elimination [2021-06-05 14:58:19,127 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2019 vanished before elimination [2021-06-05 14:58:19,127 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2009 vanished before elimination [2021-06-05 14:58:19,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:19,132 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:19,259 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-06-05 14:58:19,259 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:19,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 7 treesize of output 5 [2021-06-05 14:58:19,264 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:19,390 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-06-05 14:58:19,390 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:19,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:19,395 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:19,516 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-06-05 14:58:19,516 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:19,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 7 treesize of output 5 [2021-06-05 14:58:19,521 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:19,640 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-06-05 14:58:19,641 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:19,641 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2000 vanished before elimination [2021-06-05 14:58:19,641 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2012 vanished before elimination [2021-06-05 14:58:19,641 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2020 vanished before elimination [2021-06-05 14:58:19,641 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2010 vanished before elimination [2021-06-05 14:58:19,641 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1992 vanished before elimination [2021-06-05 14:58:19,641 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2004 vanished before elimination [2021-06-05 14:58:19,641 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2002 vanished before elimination [2021-06-05 14:58:19,641 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1994 vanished before elimination [2021-06-05 14:58:19,641 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2014 vanished before elimination [2021-06-05 14:58:19,641 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1996 vanished before elimination [2021-06-05 14:58:19,641 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2008 vanished before elimination [2021-06-05 14:58:19,641 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 14:58:19,641 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2006 vanished before elimination [2021-06-05 14:58:19,641 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1998 vanished before elimination [2021-06-05 14:58:19,646 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 14:58:19,646 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 42 variables, input treesize:1527, output treesize:254 [2021-06-05 14:58:20,231 WARN L205 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2021-06-05 14:58:20,443 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 14:58:20,443 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244053413] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:58:20,443 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:58:20,443 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:58:20,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978216864] [2021-06-05 14:58:20,443 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:58:20,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:58:20,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:58:20,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:58:20,444 INFO L87 Difference]: Start difference. First operand 488 states and 1513 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 14:58:21,077 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 133 [2021-06-05 14:58:21,571 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 140 [2021-06-05 14:58:22,255 WARN L205 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 147 [2021-06-05 14:58:22,919 WARN L205 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 162 [2021-06-05 14:58:23,254 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 83 [2021-06-05 14:58:23,975 WARN L205 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 174 [2021-06-05 14:58:24,296 WARN L205 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 80 [2021-06-05 14:58:25,225 WARN L205 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 270 DAG size of output: 181 [2021-06-05 14:58:25,445 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 66 [2021-06-05 14:58:25,953 WARN L205 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 109 [2021-06-05 14:58:25,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:58:25,960 INFO L93 Difference]: Finished difference Result 1000 states and 2843 transitions. [2021-06-05 14:58:25,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 14:58:25,960 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 14:58:25,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:58:25,961 INFO L225 Difference]: With dead ends: 1000 [2021-06-05 14:58:25,961 INFO L226 Difference]: Without dead ends: 949 [2021-06-05 14:58:25,961 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 6518.8ms TimeCoverageRelationStatistics Valid=189, Invalid=803, Unknown=0, NotChecked=0, Total=992 [2021-06-05 14:58:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2021-06-05 14:58:25,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 500. [2021-06-05 14:58:25,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 499 states have (on average 3.096192384769539) internal successors, (1545), 499 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:58:25,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1545 transitions. [2021-06-05 14:58:25,968 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1545 transitions. Word has length 20 [2021-06-05 14:58:25,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:58:25,968 INFO L482 AbstractCegarLoop]: Abstraction has 500 states and 1545 transitions. [2021-06-05 14:58:25,968 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 14:58:25,968 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1545 transitions. [2021-06-05 14:58:25,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:58:25,968 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:58:25,968 INFO L521 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 14:58:26,169 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 300 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10583 [2021-06-05 14:58:26,169 INFO L430 AbstractCegarLoop]: === Iteration 491 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:58:26,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:58:26,169 INFO L82 PathProgramCache]: Analyzing trace with hash 845614218, now seen corresponding path program 99 times [2021-06-05 14:58:26,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:58:26,169 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303532801] [2021-06-05 14:58:26,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:58:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:58:26,493 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 14:58:26,493 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:58:26,494 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303532801] [2021-06-05 14:58:26,494 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303532801] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:58:26,494 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930928506] [2021-06-05 14:58:26,494 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 301 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 301 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:58:26,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 14:58:26,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:58:26,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:58:26,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:58:26,766 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:26,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:26,767 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:27,018 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2021-06-05 14:58:27,018 INFO L628 ElimStorePlain]: treesize reduction 164, result has 66.8 percent of original size [2021-06-05 14:58:27,022 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:27,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:27,023 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:27,140 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-06-05 14:58:27,140 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:27,145 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:27,145 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:27,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:27,146 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:27,150 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:27,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:27,152 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:27,257 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-06-05 14:58:27,257 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:27,261 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:27,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:27,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 14:58:27,263 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:27,267 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:27,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 15 treesize of output 11 [2021-06-05 14:58:27,268 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:27,368 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-05 14:58:27,368 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:27,373 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:27,374 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58: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 15 treesize of output 11 [2021-06-05 14:58:27,375 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:27,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:27,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 14:58:27,380 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:27,473 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:27,476 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:27,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 15 treesize of output 11 [2021-06-05 14:58:27,477 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:27,567 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:27,573 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 14:58:27,573 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:501, output treesize:220 [2021-06-05 14:58:27,737 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 91 [2021-06-05 14:58:28,578 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_2040, v_prenex_2052, v_prenex_2060, v_prenex_2050, v_prenex_2044, v_prenex_2067, v_prenex_2056, v_prenex_2042, get_6, v_prenex_2054, v_prenex_2048, v_prenex_2038, v_prenex_2046, v_prenex_2058], 1=[v_prenex_2051, v_prenex_2041, v_prenex_2061, v_prenex_2055, v_prenex_2045, v_prenex_2053, v_prenex_2043, v_prenex_2059, v_prenex_2049, v_prenex_2068, v_prenex_2057, v_prenex_2047, get_0, v_prenex_2039]} [2021-06-05 14:58:28,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 23 treesize of output 17 [2021-06-05 14:58:28,590 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:28,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 30 treesize of output 22 [2021-06-05 14:58:28,601 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:28,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:28,611 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:29,048 WARN L205 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 105 [2021-06-05 14:58:29,048 INFO L628 ElimStorePlain]: treesize reduction 1019, result has 26.4 percent of original size [2021-06-05 14:58:29,049 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2052 vanished before elimination [2021-06-05 14:58:29,049 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2060 vanished before elimination [2021-06-05 14:58:29,049 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2050 vanished before elimination [2021-06-05 14:58:29,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 9 treesize of output 7 [2021-06-05 14:58:29,054 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:29,194 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-06-05 14:58:29,194 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:29,194 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2067 vanished before elimination [2021-06-05 14:58:29,194 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2056 vanished before elimination [2021-06-05 14:58:29,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:29,200 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:29,334 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-06-05 14:58:29,334 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:29,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 16 treesize of output 12 [2021-06-05 14:58:29,339 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:29,469 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-06-05 14:58:29,470 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:29,470 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2054 vanished before elimination [2021-06-05 14:58:29,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 9 treesize of output 7 [2021-06-05 14:58:29,475 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:29,602 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-06-05 14:58:29,602 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:29,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 14:58:29,607 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:29,730 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-06-05 14:58:29,730 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:29,730 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2046 vanished before elimination [2021-06-05 14:58:29,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:29,735 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:29,856 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-06-05 14:58:29,856 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:29,856 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2051 vanished before elimination [2021-06-05 14:58:29,856 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2041 vanished before elimination [2021-06-05 14:58:29,856 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2061 vanished before elimination [2021-06-05 14:58:29,856 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2055 vanished before elimination [2021-06-05 14:58:29,856 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2045 vanished before elimination [2021-06-05 14:58:29,856 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2053 vanished before elimination [2021-06-05 14:58:29,856 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2043 vanished before elimination [2021-06-05 14:58:29,856 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2059 vanished before elimination [2021-06-05 14:58:29,856 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2049 vanished before elimination [2021-06-05 14:58:29,857 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2068 vanished before elimination [2021-06-05 14:58:29,857 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2057 vanished before elimination [2021-06-05 14:58:29,857 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2047 vanished before elimination [2021-06-05 14:58:29,857 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 14:58:29,857 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2039 vanished before elimination [2021-06-05 14:58:29,860 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 14:58:29,860 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 42 variables, input treesize:1471, output treesize:254 [2021-06-05 14:58:30,212 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2021-06-05 14:58:30,434 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 14:58:30,434 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930928506] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:58:30,434 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:58:30,434 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:58:30,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867174220] [2021-06-05 14:58:30,435 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:58:30,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:58:30,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:58:30,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:58:30,435 INFO L87 Difference]: Start difference. First operand 500 states and 1545 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 14:58:30,965 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 118 [2021-06-05 14:58:31,383 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 122 [2021-06-05 14:58:31,848 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 134 [2021-06-05 14:58:32,631 WARN L205 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 148 [2021-06-05 14:58:33,232 WARN L205 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 158 [2021-06-05 14:58:33,965 WARN L205 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 167 [2021-06-05 14:58:34,596 WARN L205 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 172 [2021-06-05 14:58:34,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:58:34,608 INFO L93 Difference]: Finished difference Result 885 states and 2569 transitions. [2021-06-05 14:58:34,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:58:34,609 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 14:58:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:58:34,610 INFO L225 Difference]: With dead ends: 885 [2021-06-05 14:58:34,610 INFO L226 Difference]: Without dead ends: 870 [2021-06-05 14:58:34,610 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 4843.6ms TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:58:34,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2021-06-05 14:58:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 500. [2021-06-05 14:58:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 499 states have (on average 3.096192384769539) internal successors, (1545), 499 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:58:34,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1545 transitions. [2021-06-05 14:58:34,616 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1545 transitions. Word has length 20 [2021-06-05 14:58:34,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:58:34,616 INFO L482 AbstractCegarLoop]: Abstraction has 500 states and 1545 transitions. [2021-06-05 14:58:34,616 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 14:58:34,616 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1545 transitions. [2021-06-05 14:58:34,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:58:34,617 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:58:34,617 INFO L521 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 14:58:34,817 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10709,301 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:58:34,817 INFO L430 AbstractCegarLoop]: === Iteration 492 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:58:34,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:58:34,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1985898054, now seen corresponding path program 100 times [2021-06-05 14:58:34,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:58:34,818 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369321291] [2021-06-05 14:58:34,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:58:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:58:35,024 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 14:58:35,024 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:58:35,024 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369321291] [2021-06-05 14:58:35,024 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369321291] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:58:35,024 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491908075] [2021-06-05 14:58:35,024 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 302 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 302 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:58:35,049 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:58:35,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:58:35,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:58:35,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:58:35,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 37 treesize of output 27 [2021-06-05 14:58:35,149 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:35,153 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,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 36 treesize of output 26 [2021-06-05 14:58:35,157 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,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 36 treesize of output 26 [2021-06-05 14:58:35,161 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:35,165 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:35,169 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:35,173 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,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 29 treesize of output 21 [2021-06-05 14:58:35,176 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:35,180 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,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 38 treesize of output 28 [2021-06-05 14:58:35,199 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:35,204 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:35,209 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,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 14:58:35,213 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:35,217 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:35,221 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:35,225 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,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 37 treesize of output 27 [2021-06-05 14:58:35,229 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,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 44 treesize of output 32 [2021-06-05 14:58:35,234 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:35,238 INFO L550 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:35,241 INFO L550 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,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 37 treesize of output 27 [2021-06-05 14:58:35,245 INFO L550 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,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 37 treesize of output 27 [2021-06-05 14:58:35,249 INFO L550 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:35,252 INFO L550 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:35,256 INFO L550 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:35,260 INFO L550 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,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 30 treesize of output 22 [2021-06-05 14:58:35,264 INFO L550 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:35,267 INFO L550 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:35,271 INFO L550 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:35,274 INFO L550 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,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 45 treesize of output 33 [2021-06-05 14:58:35,278 INFO L550 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,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 37 treesize of output 27 [2021-06-05 14:58:35,282 INFO L550 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:35,286 INFO L550 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:35,289 INFO L550 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,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 31 treesize of output 23 [2021-06-05 14:58:35,293 INFO L550 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,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 14:58:35,296 INFO L550 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:35,299 INFO L550 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:35,411 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2021-06-05 14:58:35,411 INFO L628 ElimStorePlain]: treesize reduction 258, result has 36.6 percent of original size [2021-06-05 14:58:35,413 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:58:35,413 INFO L247 ElimStorePlain]: Needed 37 recursive calls to eliminate 1 variables, input treesize:1549, output treesize:149 [2021-06-05 14:58:35,689 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2021-06-05 14:58:35,923 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 14:58:35,923 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491908075] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:58:35,923 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:58:35,923 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:58:35,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581357550] [2021-06-05 14:58:35,924 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:58:35,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:58:35,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:58:35,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:58:35,924 INFO L87 Difference]: Start difference. First operand 500 states and 1545 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 14:58:36,348 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2021-06-05 14:58:36,612 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2021-06-05 14:58:37,027 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2021-06-05 14:58:37,510 WARN L205 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 87 [2021-06-05 14:58:38,061 WARN L205 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 96 [2021-06-05 14:58:38,894 WARN L205 SmtUtils]: Spent 804.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 106 [2021-06-05 14:58:38,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:58:38,908 INFO L93 Difference]: Finished difference Result 864 states and 2531 transitions. [2021-06-05 14:58:38,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:58:38,909 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 14:58:38,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:58:38,910 INFO L225 Difference]: With dead ends: 864 [2021-06-05 14:58:38,910 INFO L226 Difference]: Without dead ends: 842 [2021-06-05 14:58:38,910 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 3250.0ms TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:58:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2021-06-05 14:58:38,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 493. [2021-06-05 14:58:38,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 3.105691056910569) internal successors, (1528), 492 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:58:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1528 transitions. [2021-06-05 14:58:38,916 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 1528 transitions. Word has length 20 [2021-06-05 14:58:38,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:58:38,916 INFO L482 AbstractCegarLoop]: Abstraction has 493 states and 1528 transitions. [2021-06-05 14:58:38,916 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 14:58:38,916 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 1528 transitions. [2021-06-05 14:58:38,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:58:38,917 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:58:38,917 INFO L521 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 14:58:39,117 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10904,302 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:58:39,117 INFO L430 AbstractCegarLoop]: === Iteration 493 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:58:39,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:58:39,118 INFO L82 PathProgramCache]: Analyzing trace with hash -149030846, now seen corresponding path program 101 times [2021-06-05 14:58:39,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:58:39,118 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746164856] [2021-06-05 14:58:39,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:58:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:58:39,398 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 14:58:39,398 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:58:39,398 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746164856] [2021-06-05 14:58:39,398 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746164856] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:58:39,399 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813659142] [2021-06-05 14:58:39,399 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 303 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 303 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:58:39,457 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:58:39,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:58:39,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:58:39,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:58:39,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:39,619 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:39,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:39,623 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:39,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 38 treesize of output 28 [2021-06-05 14:58:39,626 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:39,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 29 treesize of output 21 [2021-06-05 14:58:39,630 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:39,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 38 treesize of output 28 [2021-06-05 14:58:39,634 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:39,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 14:58:39,638 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:39,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 31 treesize of output 23 [2021-06-05 14:58:39,641 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:39,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 23 treesize of output 17 [2021-06-05 14:58:39,645 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:39,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 23 treesize of output 17 [2021-06-05 14:58:39,648 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:39,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 14:58:39,652 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:39,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 14:58:39,655 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:39,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:39,659 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:39,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:39,662 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:39,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 37 treesize of output 27 [2021-06-05 14:58:39,666 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:39,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 37 treesize of output 27 [2021-06-05 14:58:39,669 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:39,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:39,672 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:39,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 31 treesize of output 23 [2021-06-05 14:58:39,676 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:39,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 14:58:39,679 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:39,773 INFO L628 ElimStorePlain]: treesize reduction 91, result has 62.6 percent of original size [2021-06-05 14:58:39,775 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:58:39,775 INFO L247 ElimStorePlain]: Needed 19 recursive calls to eliminate 1 variables, input treesize:697, output treesize:152 [2021-06-05 14:58:40,085 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 14:58:40,085 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813659142] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:58:40,085 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:58:40,085 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:58:40,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026123109] [2021-06-05 14:58:40,086 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:58:40,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:58:40,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:58:40,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:58:40,086 INFO L87 Difference]: Start difference. First operand 493 states and 1528 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 14:58:40,650 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2021-06-05 14:58:40,903 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2021-06-05 14:58:41,185 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 90 [2021-06-05 14:58:41,490 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 91 [2021-06-05 14:58:41,835 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 98 [2021-06-05 14:58:41,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:58:41,851 INFO L93 Difference]: Finished difference Result 812 states and 2386 transitions. [2021-06-05 14:58:41,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:58:41,851 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 14:58:41,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:58:41,852 INFO L225 Difference]: With dead ends: 812 [2021-06-05 14:58:41,852 INFO L226 Difference]: Without dead ends: 779 [2021-06-05 14:58:41,852 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2120.4ms TimeCoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:58:41,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2021-06-05 14:58:41,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 499. [2021-06-05 14:58:41,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 498 states have (on average 3.1004016064257027) internal successors, (1544), 498 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:58:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 1544 transitions. [2021-06-05 14:58:41,858 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 1544 transitions. Word has length 20 [2021-06-05 14:58:41,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:58:41,858 INFO L482 AbstractCegarLoop]: Abstraction has 499 states and 1544 transitions. [2021-06-05 14:58:41,859 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 14:58:41,859 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 1544 transitions. [2021-06-05 14:58:41,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:58:41,859 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:58:41,859 INFO L521 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 14:58:42,059 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10928,303 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:58:42,060 INFO L430 AbstractCegarLoop]: === Iteration 494 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:58:42,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:58:42,060 INFO L82 PathProgramCache]: Analyzing trace with hash 164455934, now seen corresponding path program 102 times [2021-06-05 14:58:42,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:58:42,060 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97917108] [2021-06-05 14:58:42,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:58:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:58:42,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 14:58:42,444 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:58:42,444 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97917108] [2021-06-05 14:58:42,444 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97917108] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:58:42,444 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779623411] [2021-06-05 14:58:42,444 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 304 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 304 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:58:42,469 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:58:42,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:58:42,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:58:42,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:58:43,122 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,123 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,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 30 treesize of output 22 [2021-06-05 14:58:43,124 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:43,129 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,129 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,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 29 treesize of output 21 [2021-06-05 14:58:43,130 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:43,135 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,135 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,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 22 treesize of output 16 [2021-06-05 14:58:43,136 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:43,141 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,141 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,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 23 treesize of output 17 [2021-06-05 14:58:43,142 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:43,147 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,148 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,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 14:58:43,149 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:43,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,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 22 treesize of output 16 [2021-06-05 14:58:43,154 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:43,501 WARN L205 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2021-06-05 14:58:43,501 INFO L628 ElimStorePlain]: treesize reduction 533, result has 45.3 percent of original size [2021-06-05 14:58:43,506 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,506 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:43,507 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:43,512 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,512 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,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 14:58:43,513 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:43,517 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:43,518 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:43,660 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-06-05 14:58:43,661 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:43,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:43,667 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:43,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,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 31 treesize of output 23 [2021-06-05 14:58:43,672 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:43,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:43,677 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:43,934 WARN L205 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 74 [2021-06-05 14:58:43,935 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.7 percent of original size [2021-06-05 14:58:43,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,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 15 treesize of output 11 [2021-06-05 14:58:43,940 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:43,944 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,944 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,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 14:58:43,945 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:43,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:43,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:43,950 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:44,070 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-06-05 14:58:44,070 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:44,078 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 14:58:44,078 INFO L247 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:1129, output treesize:337 [2021-06-05 14:58:44,489 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2021-06-05 14:58:44,766 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2021-06-05 14:58:45,048 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_2095, v_prenex_2093, v_prenex_2089, get_6, v_prenex_2097, v_prenex_2091], 1=[v_prenex_2096, v_prenex_2094, v_prenex_2098, get_0, v_prenex_2092, v_prenex_2090]} [2021-06-05 14:58:45,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 22 treesize of output 16 [2021-06-05 14:58:45,057 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:45,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:45,066 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:45,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 22 treesize of output 16 [2021-06-05 14:58:45,076 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:45,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 23 treesize of output 17 [2021-06-05 14:58:45,085 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:45,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:45,095 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:45,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 29 treesize of output 21 [2021-06-05 14:58:45,105 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:45,490 WARN L205 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 94 [2021-06-05 14:58:45,490 INFO L628 ElimStorePlain]: treesize reduction 1557, result has 15.4 percent of original size [2021-06-05 14:58:45,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:45,496 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:45,591 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:45,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 16 treesize of output 12 [2021-06-05 14:58:45,597 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:45,696 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:45,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:58:45,701 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:45,789 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:45,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 7 treesize of output 5 [2021-06-05 14:58:45,793 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:45,880 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:45,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 7 treesize of output 5 [2021-06-05 14:58:45,884 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:45,968 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:45,969 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2096 vanished before elimination [2021-06-05 14:58:45,969 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2094 vanished before elimination [2021-06-05 14:58:45,969 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2098 vanished before elimination [2021-06-05 14:58:45,969 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 14:58:45,969 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2092 vanished before elimination [2021-06-05 14:58:45,969 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2090 vanished before elimination [2021-06-05 14:58:45,972 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 14:58:45,972 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 18 variables, input treesize:1953, output treesize:187 [2021-06-05 14:58:46,146 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 14:58:46,146 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779623411] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:58:46,146 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:58:46,146 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:58:46,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641126790] [2021-06-05 14:58:46,146 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:58:46,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:58:46,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:58:46,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:58:46,146 INFO L87 Difference]: Start difference. First operand 499 states and 1544 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 14:58:46,461 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 85 [2021-06-05 14:58:46,681 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2021-06-05 14:58:46,920 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2021-06-05 14:58:47,654 WARN L205 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 155 [2021-06-05 14:58:48,351 WARN L205 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 175 [2021-06-05 14:58:49,097 WARN L205 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 184 [2021-06-05 14:58:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:58:49,113 INFO L93 Difference]: Finished difference Result 809 states and 2381 transitions. [2021-06-05 14:58:49,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:58:49,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 14:58:49,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:58:49,114 INFO L225 Difference]: With dead ends: 809 [2021-06-05 14:58:49,114 INFO L226 Difference]: Without dead ends: 782 [2021-06-05 14:58:49,114 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 3818.6ms TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:58:49,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2021-06-05 14:58:49,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 502. [2021-06-05 14:58:49,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 3.097804391217565) internal successors, (1552), 501 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:58:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1552 transitions. [2021-06-05 14:58:49,120 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 1552 transitions. Word has length 20 [2021-06-05 14:58:49,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:58:49,120 INFO L482 AbstractCegarLoop]: Abstraction has 502 states and 1552 transitions. [2021-06-05 14:58:49,120 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 14:58:49,120 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 1552 transitions. [2021-06-05 14:58:49,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:58:49,121 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:58:49,121 INFO L521 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 14:58:49,321 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10949,304 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:58:49,321 INFO L430 AbstractCegarLoop]: === Iteration 495 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:58:49,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:58:49,322 INFO L82 PathProgramCache]: Analyzing trace with hash 643740610, now seen corresponding path program 103 times [2021-06-05 14:58:49,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:58:49,322 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611174302] [2021-06-05 14:58:49,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:58:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:58:49,584 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 14:58:49,584 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:58:49,584 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611174302] [2021-06-05 14:58:49,584 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611174302] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:58:49,584 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336818118] [2021-06-05 14:58:49,584 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 305 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 305 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:58:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:58:49,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:58:49,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:58:49,898 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:49,898 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:49,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:49,899 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:49,904 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:49,904 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:49,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:49,905 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:49,909 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:49,909 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:49,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:49,910 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:49,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:49,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:49,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:49,915 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:49,919 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:49,919 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:49,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:49,920 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:49,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:49,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 30 treesize of output 22 [2021-06-05 14:58:49,925 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:50,130 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2021-06-05 14:58:50,130 INFO L628 ElimStorePlain]: treesize reduction 322, result has 47.0 percent of original size [2021-06-05 14:58:50,134 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:50,134 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:50,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 15 treesize of output 11 [2021-06-05 14:58:50,135 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:50,139 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:50,139 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:50,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:50,140 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:50,143 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:50,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 22 treesize of output 16 [2021-06-05 14:58:50,144 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:50,226 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:50,230 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:50,230 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:50,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 14:58:50,231 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:50,234 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:50,235 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:50,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:50,236 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:50,239 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:50,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 23 treesize of output 17 [2021-06-05 14:58:50,240 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:50,378 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2021-06-05 14:58:50,378 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.5 percent of original size [2021-06-05 14:58:50,384 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 14:58:50,384 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:757, output treesize:201 [2021-06-05 14:58:50,945 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2021-06-05 14:58:51,093 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 14:58:51,093 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336818118] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:58:51,093 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:58:51,093 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:58:51,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250507827] [2021-06-05 14:58:51,093 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:58:51,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:58:51,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:58:51,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:58:51,093 INFO L87 Difference]: Start difference. First operand 502 states and 1552 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 14:58:51,616 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2021-06-05 14:58:51,890 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-05 14:58:52,071 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 72 [2021-06-05 14:58:52,483 WARN L205 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 118 [2021-06-05 14:58:52,641 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2021-06-05 14:58:52,946 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 124 [2021-06-05 14:58:53,119 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2021-06-05 14:58:53,681 WARN L205 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 133 [2021-06-05 14:58:53,855 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2021-06-05 14:58:54,375 WARN L205 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 116 [2021-06-05 14:58:54,685 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 122 [2021-06-05 14:58:54,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:58:54,686 INFO L93 Difference]: Finished difference Result 1014 states and 2865 transitions. [2021-06-05 14:58:54,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 14:58:54,686 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 14:58:54,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:58:54,687 INFO L225 Difference]: With dead ends: 1014 [2021-06-05 14:58:54,687 INFO L226 Difference]: Without dead ends: 978 [2021-06-05 14:58:54,687 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 4075.8ms TimeCoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 14:58:54,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2021-06-05 14:58:54,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 511. [2021-06-05 14:58:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 3.096078431372549) internal successors, (1579), 510 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:58:54,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 1579 transitions. [2021-06-05 14:58:54,694 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 1579 transitions. Word has length 20 [2021-06-05 14:58:54,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:58:54,694 INFO L482 AbstractCegarLoop]: Abstraction has 511 states and 1579 transitions. [2021-06-05 14:58:54,694 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 14:58:54,695 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 1579 transitions. [2021-06-05 14:58:54,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:58:54,695 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:58:54,695 INFO L521 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 14:58:54,895 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 305 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11149 [2021-06-05 14:58:54,895 INFO L430 AbstractCegarLoop]: === Iteration 496 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:58:54,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:58:54,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1054979778, now seen corresponding path program 104 times [2021-06-05 14:58:54,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:58:54,896 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604974182] [2021-06-05 14:58:54,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:58:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:58:55,199 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 14:58:55,199 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:58:55,200 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604974182] [2021-06-05 14:58:55,200 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604974182] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:58:55,200 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413245871] [2021-06-05 14:58:55,200 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 306 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 306 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:58:55,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:58:55,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:58:55,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:58:55,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:58:55,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:55,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:55,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:55,516 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:55,520 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:55,520 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:55,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 30 treesize of output 22 [2021-06-05 14:58:55,521 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:55,525 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:55,525 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:55,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:55,526 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:55,530 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:55,530 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:55,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 14:58:55,532 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:55,536 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:55,536 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:55,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 37 treesize of output 27 [2021-06-05 14:58:55,537 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:55,541 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:55,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 38 treesize of output 28 [2021-06-05 14:58:55,542 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:55,743 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2021-06-05 14:58:55,744 INFO L628 ElimStorePlain]: treesize reduction 306, result has 46.8 percent of original size [2021-06-05 14:58:55,747 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:55,747 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:55,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:55,748 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:55,752 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:55,752 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:55,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 22 treesize of output 16 [2021-06-05 14:58:55,753 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:55,756 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:55,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 23 treesize of output 17 [2021-06-05 14:58:55,757 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:55,837 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:58:55,841 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:55,841 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:55,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:55,842 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:55,846 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:55,846 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:55,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:58:55,847 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:55,850 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:58:55,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 14:58:55,850 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:58:55,988 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2021-06-05 14:58:55,988 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.5 percent of original size [2021-06-05 14:58:55,994 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 14:58:55,994 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:757, output treesize:201 [2021-06-05 14:58:56,668 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 14:58:56,669 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413245871] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:58:56,669 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:58:56,669 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:58:56,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192601556] [2021-06-05 14:58:56,669 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:58:56,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:58:56,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:58:56,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:58:56,669 INFO L87 Difference]: Start difference. First operand 511 states and 1579 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 14:58:57,123 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2021-06-05 14:58:57,450 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 114 [2021-06-05 14:58:57,793 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 118 [2021-06-05 14:58:58,305 WARN L205 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 129 [2021-06-05 14:58:58,891 WARN L205 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 134 [2021-06-05 14:58:59,549 WARN L205 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 141 [2021-06-05 14:58:59,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:58:59,576 INFO L93 Difference]: Finished difference Result 813 states and 2401 transitions. [2021-06-05 14:58:59,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:58:59,576 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 14:58:59,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:58:59,577 INFO L225 Difference]: With dead ends: 813 [2021-06-05 14:58:59,577 INFO L226 Difference]: Without dead ends: 798 [2021-06-05 14:58:59,577 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 3362.6ms TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:58:59,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2021-06-05 14:58:59,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 502. [2021-06-05 14:58:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 3.1037924151696608) internal successors, (1555), 501 states have internal predecessors, (1555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:58:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1555 transitions. [2021-06-05 14:58:59,583 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 1555 transitions. Word has length 20 [2021-06-05 14:58:59,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:58:59,583 INFO L482 AbstractCegarLoop]: Abstraction has 502 states and 1555 transitions. [2021-06-05 14:58:59,583 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 14:58:59,583 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 1555 transitions. [2021-06-05 14:58:59,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:58:59,584 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:58:59,584 INFO L521 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 14:58:59,784 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 306 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11228 [2021-06-05 14:58:59,784 INFO L430 AbstractCegarLoop]: === Iteration 497 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:58:59,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:58:59,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1336163992, now seen corresponding path program 105 times [2021-06-05 14:58:59,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:58:59,785 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619337436] [2021-06-05 14:58:59,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:58:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:59:00,039 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 14:59:00,039 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:59:00,039 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619337436] [2021-06-05 14:59:00,039 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619337436] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:59:00,039 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068085151] [2021-06-05 14:59:00,039 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 307 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 307 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:59:00,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:59:00,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:59:00,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:59:00,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:59:00,816 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:00,817 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:00,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:59:00,818 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:00,823 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:00,824 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:00,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:59:00,825 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:00,830 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:00,831 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:00,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:59:00,832 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:00,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:00,838 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:00,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:59:00,839 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:00,845 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:00,845 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:00,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:59:00,846 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:00,859 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:00,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 29 treesize of output 21 [2021-06-05 14:59:00,860 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:01,289 WARN L205 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2021-06-05 14:59:01,290 INFO L628 ElimStorePlain]: treesize reduction 576, result has 46.9 percent of original size [2021-06-05 14:59:01,294 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:01,295 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:01,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:59:01,296 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:01,300 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:01,300 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:01,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:59:01,302 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:01,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:01,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 14:59:01,307 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:01,637 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 83 [2021-06-05 14:59:01,637 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.8 percent of original size [2021-06-05 14:59:01,642 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:01,642 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:01,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:59:01,643 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:01,647 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:01,647 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:01,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 23 treesize of output 17 [2021-06-05 14:59:01,648 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:01,652 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:01,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 22 treesize of output 16 [2021-06-05 14:59:01,653 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:01,824 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-06-05 14:59:01,824 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:59:01,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:01,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:01,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:59:01,830 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:01,835 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:01,835 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:01,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:59:01,836 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:01,841 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:01,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 15 treesize of output 11 [2021-06-05 14:59:01,841 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:01,996 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2021-06-05 14:59:01,997 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:59:02,007 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 14:59:02,007 INFO L247 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:1249, output treesize:404 [2021-06-05 14:59:02,196 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2021-06-05 14:59:02,486 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 108 [2021-06-05 14:59:02,735 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_2150, v_prenex_2172, v_prenex_2162, v_prenex_2170, v_prenex_2160, v_prenex_2154, v_prenex_2152, get_6, v_prenex_2164, v_prenex_2158, v_prenex_2156, v_prenex_2168], 1=[v_prenex_2161, v_prenex_2151, v_prenex_2173, v_prenex_2171, v_prenex_2165, v_prenex_2155, v_prenex_2163, v_prenex_2153, v_prenex_2169, v_prenex_2159, v_prenex_2157, get_0]} [2021-06-05 14:59:02,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 14:59:02,746 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:02,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 38 treesize of output 28 [2021-06-05 14:59:02,757 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:02,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:59:02,768 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:03,118 WARN L205 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 93 [2021-06-05 14:59:03,119 INFO L628 ElimStorePlain]: treesize reduction 910, result has 23.7 percent of original size [2021-06-05 14:59:03,119 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2172 vanished before elimination [2021-06-05 14:59:03,119 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2162 vanished before elimination [2021-06-05 14:59:03,119 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2170 vanished before elimination [2021-06-05 14:59:03,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 7 treesize of output 5 [2021-06-05 14:59:03,124 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:03,218 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:59:03,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:59:03,224 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:03,315 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:59:03,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 7 treesize of output 5 [2021-06-05 14:59:03,320 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:03,412 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:59:03,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 7 treesize of output 5 [2021-06-05 14:59:03,417 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:03,504 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:59:03,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 15 treesize of output 11 [2021-06-05 14:59:03,509 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:03,594 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:59:03,594 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2158 vanished before elimination [2021-06-05 14:59:03,594 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2156 vanished before elimination [2021-06-05 14:59:03,594 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2168 vanished before elimination [2021-06-05 14:59:03,594 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2161 vanished before elimination [2021-06-05 14:59:03,594 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2151 vanished before elimination [2021-06-05 14:59:03,594 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2173 vanished before elimination [2021-06-05 14:59:03,594 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2171 vanished before elimination [2021-06-05 14:59:03,594 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2165 vanished before elimination [2021-06-05 14:59:03,595 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2155 vanished before elimination [2021-06-05 14:59:03,595 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2163 vanished before elimination [2021-06-05 14:59:03,595 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2153 vanished before elimination [2021-06-05 14:59:03,595 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2169 vanished before elimination [2021-06-05 14:59:03,595 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2159 vanished before elimination [2021-06-05 14:59:03,595 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2157 vanished before elimination [2021-06-05 14:59:03,595 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 14:59:03,598 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 14:59:03,598 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 36 variables, input treesize:1299, output treesize:187 [2021-06-05 14:59:03,767 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 14:59:03,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068085151] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:59:03,767 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:59:03,767 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:59:03,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136037438] [2021-06-05 14:59:03,768 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:59:03,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:59:03,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:59:03,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:59:03,768 INFO L87 Difference]: Start difference. First operand 502 states and 1555 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 14:59:04,078 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2021-06-05 14:59:04,308 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 82 [2021-06-05 14:59:04,537 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2021-06-05 14:59:05,036 WARN L205 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 156 [2021-06-05 14:59:05,446 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2021-06-05 14:59:05,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:59:05,459 INFO L93 Difference]: Finished difference Result 723 states and 2151 transitions. [2021-06-05 14:59:05,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:59:05,459 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 14:59:05,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:59:05,460 INFO L225 Difference]: With dead ends: 723 [2021-06-05 14:59:05,460 INFO L226 Difference]: Without dead ends: 696 [2021-06-05 14:59:05,460 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 2385.2ms TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:59:05,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2021-06-05 14:59:05,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 508. [2021-06-05 14:59:05,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 3.09861932938856) internal successors, (1571), 507 states have internal predecessors, (1571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:59:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1571 transitions. [2021-06-05 14:59:05,465 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 1571 transitions. Word has length 20 [2021-06-05 14:59:05,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:59:05,466 INFO L482 AbstractCegarLoop]: Abstraction has 508 states and 1571 transitions. [2021-06-05 14:59:05,466 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 14:59:05,466 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 1571 transitions. [2021-06-05 14:59:05,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:59:05,466 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:59:05,466 INFO L521 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 14:59:05,666 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 307 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11333 [2021-06-05 14:59:05,667 INFO L430 AbstractCegarLoop]: === Iteration 498 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:59:05,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:59:05,667 INFO L82 PathProgramCache]: Analyzing trace with hash -856879316, now seen corresponding path program 106 times [2021-06-05 14:59:05,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:59:05,667 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441065797] [2021-06-05 14:59:05,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:59:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:59:05,884 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 14:59:05,884 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:59:05,884 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441065797] [2021-06-05 14:59:05,884 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441065797] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:59:05,884 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331330336] [2021-06-05 14:59:05,884 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 308 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 308 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:59:05,909 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:59:05,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:59:05,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:59:05,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:59:06,298 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:06,298 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:06,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 31 treesize of output 23 [2021-06-05 14:59:06,299 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:06,304 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:06,304 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59: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 31 treesize of output 23 [2021-06-05 14:59:06,306 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:06,310 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:06,311 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:06,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 37 treesize of output 27 [2021-06-05 14:59:06,312 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:06,316 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:06,317 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:06,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:59:06,318 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:06,322 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:06,322 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:06,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:59:06,323 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:06,327 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:06,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:59:06,329 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:06,608 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2021-06-05 14:59:06,608 INFO L628 ElimStorePlain]: treesize reduction 364, result has 48.4 percent of original size [2021-06-05 14:59:06,612 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:06,612 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:06,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 14:59:06,613 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:06,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:06,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:06,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:59:06,618 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:06,621 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:06,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:59:06,622 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:06,850 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2021-06-05 14:59:06,850 INFO L628 ElimStorePlain]: treesize reduction 1, result has 99.7 percent of original size [2021-06-05 14:59:06,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:06,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:06,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 23 treesize of output 17 [2021-06-05 14:59:06,855 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:06,859 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:06,859 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:06,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14:59:06,860 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:06,864 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:59:06,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 22 treesize of output 16 [2021-06-05 14:59:06,865 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:06,972 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2021-06-05 14:59:06,973 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:59:06,979 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 14:59:06,979 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:901, output treesize:273 [2021-06-05 14:59:07,753 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_2195, v_prenex_2193, v_prenex_2220, v_prenex_2199, get_6, v_prenex_2197, v_prenex_2213, v_prenex_2203, v_prenex_2211, v_prenex_2201, v_prenex_2207, v_prenex_2215, v_prenex_2205, v_prenex_2209], 1=[v_prenex_2194, v_prenex_2198, v_prenex_2221, v_prenex_2210, v_prenex_2196, v_prenex_2202, v_prenex_2214, v_prenex_2200, v_prenex_2212, v_prenex_2206, get_0, v_prenex_2204, v_prenex_2216, v_prenex_2208]} [2021-06-05 14:59:07,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 15 treesize of output 11 [2021-06-05 14:59:07,766 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:08,229 WARN L205 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 111 [2021-06-05 14:59:08,230 INFO L628 ElimStorePlain]: treesize reduction 1135, result has 24.6 percent of original size [2021-06-05 14:59:08,230 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2193 vanished before elimination [2021-06-05 14:59:08,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:59:08,236 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:08,371 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-06-05 14:59:08,371 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:59:08,371 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2199 vanished before elimination [2021-06-05 14:59:08,372 INFO L518 ElimStorePlain]: Eliminatee get_6 vanished before elimination [2021-06-05 14:59:08,372 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2197 vanished before elimination [2021-06-05 14:59:08,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 16 treesize of output 12 [2021-06-05 14:59:08,384 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:08,515 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-06-05 14:59:08,516 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:59:08,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:59:08,522 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:08,645 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-06-05 14:59:08,645 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:59:08,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 9 treesize of output 7 [2021-06-05 14:59:08,650 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:08,772 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-05 14:59:08,772 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:59:08,773 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2201 vanished before elimination [2021-06-05 14:59:08,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 7 treesize of output 5 [2021-06-05 14:59:08,778 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:08,898 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-06-05 14:59:08,898 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:59:08,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 9 treesize of output 7 [2021-06-05 14:59:08,903 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:09,024 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-06-05 14:59:09,024 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:59:09,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 7 treesize of output 5 [2021-06-05 14:59:09,029 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:09,145 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-06-05 14:59:09,145 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:59:09,146 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2209 vanished before elimination [2021-06-05 14:59:09,146 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2194 vanished before elimination [2021-06-05 14:59:09,146 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2198 vanished before elimination [2021-06-05 14:59:09,146 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2221 vanished before elimination [2021-06-05 14:59:09,146 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2210 vanished before elimination [2021-06-05 14:59:09,146 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2196 vanished before elimination [2021-06-05 14:59:09,146 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2202 vanished before elimination [2021-06-05 14:59:09,146 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2214 vanished before elimination [2021-06-05 14:59:09,146 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2200 vanished before elimination [2021-06-05 14:59:09,146 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2212 vanished before elimination [2021-06-05 14:59:09,146 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2206 vanished before elimination [2021-06-05 14:59:09,146 INFO L518 ElimStorePlain]: Eliminatee get_0 vanished before elimination [2021-06-05 14:59:09,146 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2204 vanished before elimination [2021-06-05 14:59:09,146 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2216 vanished before elimination [2021-06-05 14:59:09,146 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2208 vanished before elimination [2021-06-05 14:59:09,149 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 14:59:09,150 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 42 variables, input treesize:1513, output treesize:253 [2021-06-05 14:59:09,448 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2021-06-05 14:59:09,571 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 14:59:09,572 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331330336] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:59:09,572 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:59:09,572 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:59:09,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431753659] [2021-06-05 14:59:09,572 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:59:09,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:59:09,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:59:09,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:59:09,572 INFO L87 Difference]: Start difference. First operand 508 states and 1571 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 14:59:09,827 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2021-06-05 14:59:10,076 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2021-06-05 14:59:10,428 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 115 [2021-06-05 14:59:10,750 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2021-06-05 14:59:11,135 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2021-06-05 14:59:11,641 WARN L205 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2021-06-05 14:59:11,763 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2021-06-05 14:59:11,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:59:11,788 INFO L93 Difference]: Finished difference Result 864 states and 2475 transitions. [2021-06-05 14:59:11,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 14:59:11,788 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 14:59:11,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:59:11,789 INFO L225 Difference]: With dead ends: 864 [2021-06-05 14:59:11,789 INFO L226 Difference]: Without dead ends: 828 [2021-06-05 14:59:11,789 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 2706.7ms TimeCoverageRelationStatistics Valid=150, Invalid=780, Unknown=0, NotChecked=0, Total=930 [2021-06-05 14:59:11,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2021-06-05 14:59:11,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 514. [2021-06-05 14:59:11,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 513 states have (on average 3.0935672514619883) internal successors, (1587), 513 states have internal predecessors, (1587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:59:11,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1587 transitions. [2021-06-05 14:59:11,795 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1587 transitions. Word has length 20 [2021-06-05 14:59:11,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:59:11,795 INFO L482 AbstractCegarLoop]: Abstraction has 514 states and 1587 transitions. [2021-06-05 14:59:11,795 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 14:59:11,795 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1587 transitions. [2021-06-05 14:59:11,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 14:59:11,796 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:59:11,796 INFO L521 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 14:59:11,996 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11471,308 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:59:11,996 INFO L430 AbstractCegarLoop]: === Iteration 499 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:59:11,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:59:11,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1739367592, now seen corresponding path program 107 times [2021-06-05 14:59:11,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:59:11,996 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172020026] [2021-06-05 14:59:11,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:59:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:59:12,351 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 14:59:12,351 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:59:12,351 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172020026] [2021-06-05 14:59:12,351 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172020026] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:59:12,351 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862289354] [2021-06-05 14:59:12,351 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 309 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 309 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:59:12,377 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:59:12,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:59:12,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:59:12,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:59:12,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 22 treesize of output 16 [2021-06-05 14:59:12,571 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:12,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 30 treesize of output 22 [2021-06-05 14:59:12,574 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:12,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 31 treesize of output 23 [2021-06-05 14:59:12,578 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:12,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 30 treesize of output 22 [2021-06-05 14:59:12,582 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:12,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 31 treesize of output 23 [2021-06-05 14:59:12,585 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:12,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 22 treesize of output 16 [2021-06-05 14:59:12,589 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:12,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 30 treesize of output 22 [2021-06-05 14:59:12,593 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:12,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 31 treesize of output 23 [2021-06-05 14:59:12,596 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:12,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 37 treesize of output 27 [2021-06-05 14:59:12,600 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:12,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 29 treesize of output 21 [2021-06-05 14:59:12,604 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:12,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 23 treesize of output 17 [2021-06-05 14:59:12,607 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:12,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:59:12,611 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:12,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:59:12,615 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:12,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 14:59:12,618 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:12,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 30 treesize of output 22 [2021-06-05 14:59:12,622 INFO L550 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:12,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 38 treesize of output 28 [2021-06-05 14:59:12,626 INFO L550 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:12,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 38 treesize of output 28 [2021-06-05 14:59:12,629 INFO L550 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:12,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 23 treesize of output 17 [2021-06-05 14:59:12,633 INFO L550 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-06-05 14:59:12,742 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2021-06-05 14:59:12,742 INFO L628 ElimStorePlain]: treesize reduction 103, result has 63.5 percent of original size [2021-06-05 14:59:12,743 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2021-06-05 14:59:12,743 INFO L247 ElimStorePlain]: Needed 19 recursive calls to eliminate 1 variables, input treesize:751, output treesize:179 [2021-06-05 14:59:13,076 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 14:59:13,077 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862289354] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:59:13,077 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:59:13,077 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:59:13,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865198141] [2021-06-05 14:59:13,077 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:59:13,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:59:13,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:59:13,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:59:13,077 INFO L87 Difference]: Start difference. First operand 514 states and 1587 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 14:59:13,992 WARN L205 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2021-06-05 14:59:14,254 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 Received shutdown request... [2021-06-05 14:59:14,456 WARN L222 SmtUtils]: Removed 11 from assertion stack [2021-06-05 14:59:14,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 14:59:14,657 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 309 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11616 [2021-06-05 14:59:14,657 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 14:59:14,659 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 14:59:14,660 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 14:59:14,660 INFO L202 PluginConnector]: Adding new model word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 02:59:14 BasicIcfg [2021-06-05 14:59:14,660 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 14:59:14,661 INFO L168 Benchmark]: Toolchain (without parser) took 802366.92 ms. Allocated memory was 364.9 MB in the beginning and 1.2 GB in the end (delta: 834.7 MB). Free memory was 343.9 MB in the beginning and 1.0 GB in the end (delta: -675.1 MB). Peak memory consumption was 159.9 MB. Max. memory is 16.0 GB. [2021-06-05 14:59:14,661 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.13 ms. Allocated memory is still 364.9 MB. Free memory was 345.3 MB in the beginning and 345.2 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 14:59:14,661 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.28 ms. Allocated memory is still 364.9 MB. Free memory was 343.8 MB in the beginning and 342.3 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 14:59:14,661 INFO L168 Benchmark]: Boogie Preprocessor took 25.00 ms. Allocated memory is still 364.9 MB. Free memory was 342.3 MB in the beginning and 341.2 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 14:59:14,661 INFO L168 Benchmark]: RCFGBuilder took 369.76 ms. Allocated memory is still 364.9 MB. Free memory was 341.2 MB in the beginning and 341.5 MB in the end (delta: -315.0 kB). Peak memory consumption was 21.6 MB. Max. memory is 16.0 GB. [2021-06-05 14:59:14,661 INFO L168 Benchmark]: TraceAbstraction took 801931.43 ms. Allocated memory was 364.9 MB in the beginning and 1.2 GB in the end (delta: 834.7 MB). Free memory was 341.5 MB in the beginning and 1.0 GB in the end (delta: -677.5 MB). Peak memory consumption was 159.3 MB. Max. memory is 16.0 GB. [2021-06-05 14:59:14,661 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.13 ms. Allocated memory is still 364.9 MB. Free memory was 345.3 MB in the beginning and 345.2 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 36.28 ms. Allocated memory is still 364.9 MB. Free memory was 343.8 MB in the beginning and 342.3 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 25.00 ms. Allocated memory is still 364.9 MB. Free memory was 342.3 MB in the beginning and 341.2 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 369.76 ms. Allocated memory is still 364.9 MB. Free memory was 341.2 MB in the beginning and 341.5 MB in the end (delta: -315.0 kB). Peak memory consumption was 21.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 801931.43 ms. Allocated memory was 364.9 MB in the beginning and 1.2 GB in the end (delta: 834.7 MB). Free memory was 341.5 MB in the beginning and 1.0 GB in the end (delta: -677.5 MB). Peak memory consumption was 159.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 122]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (514states) and FLOYD_HOARE automaton (currently 9 states, 20 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 164ms.. - TimeoutResultAtElement [Line: 118]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (514states) and FLOYD_HOARE automaton (currently 9 states, 20 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 164ms.. - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (514states) and FLOYD_HOARE automaton (currently 9 states, 20 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 164ms.. - TimeoutResultAtElement [Line: 128]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (514states) and FLOYD_HOARE automaton (currently 9 states, 20 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 103 for 164ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 38 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 801870.0ms, OverallIterations: 499, TraceHistogramMax: 1, EmptinessCheckTime: 190.7ms, AutomataDifference: 398922.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 23.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 25598 SDtfs, 49274 SDslu, 121452 SDs, 0 SdLazy, 100495 SolverSat, 4871 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 54143.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12110 GetRequests, 4826 SyntacticMatches, 309 SemanticMatches, 6974 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11861 ImplicationChecksByTransitivity, 460060.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=514occurred in iteration=498, InterpolantAutomatonStates: 4326, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1899.2ms AutomataMinimizationTime, 498 MinimizatonAttempts, 93921 StatesRemovedByMinimization, 496 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1214.2ms SsaConstructionTime, 3185.5ms SatisfiabilityAnalysisTime, 327558.3ms InterpolantComputationTime, 15108 NumberOfCodeBlocks, 15108 NumberOfCodeBlocksAsserted, 1036 NumberOfCheckSat, 14301 ConstructedInterpolants, 585 QuantifiedInterpolants, 332362 SizeOfPredicates, 2325 NumberOfNonLiveVariables, 22548 ConjunctsInSsa, 4733 ConjunctsInUnsatCore, 807 InterpolantComputations, 191 PerfectInterpolantSequences, 296/1412 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